scientific article; zbMATH DE number 1145349

MaRDI QIDQ4384645zbMATH OpenFDO

Authors Aimin Yang, Yanpei Liu

Publication date 26 April 1998

zbMATH Keywords

algorithmic complexityoptimal elimination order problem for graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimal elimination ordering for graphs of bounded degree
• scientific article; zbMATH DE number 1107728
• scientific article; zbMATH DE number 4093493
• Some minimax problems for graphs
• scientific article; zbMATH DE number 1958588
• Minmax relations for cyclically ordered digraphs
• Elimination properties for minimal dominating sets of graphs
• Min-orderable digraphs
• scientific article; zbMATH DE number 4152428
• Minimal elimination of planar graphs

Cited in

(6)

• Minimal elimination ordering for graphs of bounded degree
• How to eliminate a graph
• On distance-preserving elimination orderings in graphs: complexity and algorithms
• scientific article; zbMATH DE number 151797 (Why is no real title available?)
• Minimal elimination of planar graphs
• scientific article; zbMATH DE number 1107728 (Why is no real title available?)

This page was built for publication:

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