A note on Winkler's algorithm for factoring a connected graph
From MaRDI portal
Publication:686292
DOI10.1016/0012-365X(92)90283-LzbMath0780.05045MaRDI QIDQ686292
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Factoring cartesian‐product graphs ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Computing equivalence classes among the edges of a graph with applications ⋮ Finding the prime factors of strong direct product graphs in polynomial time ⋮ Cartesian graph factorization at logarithmic cost per edge
Cites Work
- Unnamed Item
- Factoring a graph in polynomial time
- Computing equivalence classes among the edges of a graph with applications
- Graph multiplication
- 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: A note on Winkler's algorithm for factoring a connected graph
