Computing equivalence classes among the edges of a graph with applications

DOI10.1016/0012-365X(92)90274-JzbMATH Open0795.05130MaRDI QIDQ686277FDOQ686277

Authors: Franz Aurenhammer, Johann Hagauer 

Publication date: 14 October 1993

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

Recommendations

• scientific article; zbMATH DE number 1138598
• Hypergraph isomorphism and structural equivalence of Boolean functions
• scientific article; zbMATH DE number 1086495
• On a special restriction of a reflexive and symmetric relation to an equivalence relation
• scientific article
• McKay's canonical graph labeling algorithm
• Succinct data structures for representing equivalence classes
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Congruence relations of paths: some combinatorial properties
• scientific article; zbMATH DE number 2123426

zbMATH Keywords

graph algorithmsequivalence classesisometric embeddability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686277)