Deleting vertices to bound path length
From MaRDI portal
Publication:4419764
DOI10.1109/12.312117zbMath1061.68541OpenAlexW2079297844MaRDI QIDQ4419764
Sudhakar M. Reddy, Doowon Paik, Sartaj K. Sahni
Publication date: 1994
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8feb58d33bccab4464ba82566003428166640834
Related Items
Using edge contractions and vertex deletions to reduce the independence number and the clique number ⋮ On the approximability of digraph ordering ⋮ Reducing graph parameters by contractions and deletions ⋮ Unnamed Item ⋮ Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms ⋮ Unnamed Item
This page was built for publication: Deleting vertices to bound path length