Optimal vertex ordering of graphs
From MaRDI portal
Publication:1607014
DOI10.1016/S0020-0190(99)00148-9zbMATH Open0995.05136MaRDI QIDQ1607014FDOQ1607014
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Trees in Polyhedral Graphs
- Finding Minimum Spanning Trees
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Title not available (Why is that?)
- Matchings in polytopal graphs
- Priority queues with update and finding minimum spanning trees
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex ordering with optimal number of adjacent predecessors
- Vertex ordering and partitioning problems for random spatial graphs.
- Title not available (Why is that?)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- Balanced vertex-orderings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining optimally ordered pairs using edge-coloring of graphs
This page was built for publication: Optimal vertex ordering of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607014)