Pulse nav.journalClub Debates activos Tendencias Explorar Investigadores

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Inicio Explorar nav.journalClub Tendencias

⌘+K

© Synapse Social LLC, 2026

Política de privacidad

Corrections to Bierstone's Algorithm for Generating Cliques | Synapse

April 1, 1972Open Access

Corrections to Bierstone's Algorithm for Generating Cliques

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

Recently Augustson and Minker presented a version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph. Their version contains two errors. In this paper the counterexamples to their version and the modified version of the Bierstone algorithm are presented.

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Mulligan et al. (Sat,) studied this question.

synapsesocial.com/papers/6a1bfce400ee29383e9d43cf https://doi.org/https://doi.org/10.1145/321694.321698

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1An Analysis of Some Graph Theoretical Cluster Techniques1970 · 229 citations
2LINEAR ASSOCIATIVE INFORMATION RETRIEVAL1962 · 30 citations
3Foreword to papers in this issue [Fundamental Research in Superconductivity]1962 · 3 citations
4The design of multiple-access computer systems1967 · 16 citations
5The Association Factor in Information Retrieval1961 · 106 citations