An algorithm for finding the essential sets of arcs of certain graphs

DOI10.1016/0095-8956(71)90053-0zbMath0175.50506OpenAlexW2033661926MaRDI QIDQ2533378

Pierre Robert

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90053-0

zbMATH Keywords

topology

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Reduction of a nilpotent fuzzy matrix ⋮ Transitivity of generalized fuzzy matrices

Cites Work

• Unnamed Item
• Généralisation de l'algorithme de Warshall
• A Note on a Generalization of Boolean Matrix Theory

This page was built for publication: An algorithm for finding the essential sets of arcs of certain graphs