Making an arbitrary filled graph minimal by removing fill edges

DOI10.1007/3-540-61422-2_130zbMATH Open0886.05104OpenAlexW1580957752MaRDI QIDQ4375644FDOQ4375644

Authors: Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle 

Publication date: 8 February 1998

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_130

Recommendations

• A practical algorithm for making filled graphs minimal
• scientific article
• scientific article; zbMATH DE number 4093493
• Deleting Edges from Ramsey Minimal Examples
• scientific article; zbMATH DE number 7057487
• On making a distinguished vertex minimum degree by vertex deletion
• On making a distinguished vertex of minimum degree by vertex deletion
• Finding the root graph through minimum edge deletion
• Minimal elimination of planar graphs

zbMATH Keywords

algorithmfilled graphfill edges

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• A practical algorithm for making filled graphs minimal
• Minimal elimination of planar graphs
• Minimizing elimination tree height can increase fill more than linearly
• Deleting Edges from Ramsey Minimal Examples

This page was built for publication: Making an arbitrary filled graph minimal by removing fill edges

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