Minimum Degree Orderings

DOI10.1007/978-3-540-77120-3_4MaRDI QIDQ5387742zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_4

Mathematics Subject Classification ID

Vertex degrees (05C07) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum degree orderings
• The Minimum Degree Ordering with Constraints
• Minimal orderings revisited
• Degrees bounding minimal degrees
• An Approximate Minimum Degree Ordering Algorithm
• Linear orderings of low degree
• Constructing minimal pairs of degrees
• Minimum degree and graph minors
• Minimal elimination ordering for graphs of bounded degree
• Min-orderable digraphs

Cited in

(3)

• Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
• On minimizing symmetric set functions
• Minimum degree orderings

This page was built for publication: Minimum Degree Orderings

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