Optimal vertex ordering of graphs
From MaRDI portal
Publication:1607014
DOI10.1016/S0020-0190(99)00148-9zbMath0995.05136MaRDI QIDQ1607014
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A note on two problems in connexion with graphs
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Priority queues with update and finding minimum spanning trees
- Matchings in polytopal graphs
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Finding Minimum Spanning Trees
- Trees in Polyhedral Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal vertex ordering of graphs