Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal vertex ordering of graphs

From MaRDI portal
Publication:1607014
Jump to:navigation, search

DOI10.1016/S0020-0190(99)00148-9zbMath0995.05136MaRDI QIDQ1607014

Horst Bunke, Xiaoyi Jiang

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

minimum-weight spanning treeoptimal vertex ordering


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1607014&oldid=13910932"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki