Computing equivalence classes among the edges of a graph with applications

DOI10.1016/0012-365X(92)90274-JzbMath0795.05130MaRDI QIDQ686277

Franz Aurenhammer, Johann Hagauer

Publication date: 14 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalence classesgraph algorithmsisometric embeddability

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Faster isometric embedding in products of complete graphs ⋮ Factoring cartesian‐product graphs ⋮ Recognizing binary Hamming graphs inO(n 2 logn) time ⋮ Finding the prime factors of strong direct product graphs in polynomial time ⋮ A note on Winkler's algorithm for factoring a connected graph ⋮ Cartesian graph factorization at logarithmic cost per edge

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring a graph in polynomial time
• Finding the prime factors of strong direct product graphs in polynomial time
• A note on Winkler's algorithm for factoring a connected graph
• Graph multiplication
• Isometric embedding in products of complete graphs
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Distance-preserving subgraphs of hypercubes
• On Isometric Embeddings of Graphs
• Product graph representations

This page was built for publication: Computing equivalence classes among the edges of a graph with applications