Making an arbitrary filled graph minimal by removing fill edges

DOI10.1007/3-540-61422-2_130zbMath0886.05104OpenAlexW1580957752MaRDI QIDQ4375644

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

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

zbMATH Keywords

algorithmfilled graphfill edges

Mathematics Subject Classification ID

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

Related Items (2)

Minimal elimination of planar graphs ⋮ A practical algorithm for making filled graphs minimal

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