scientific article; zbMATH DE number 1563034
From MaRDI portal
Publication:4761320
DOI<203::AID-NET1>3.0.CO;2-U 10.1002/1097-0037(200012)36:4<203::AID-NET1>3.0.CO;2-UzbMath0968.05072MaRDI QIDQ4761320
Randeep Bhatia, Robert Pless, Samir Khuller, Yoram J. Sussmann
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree ⋮ On the directed full degree spanning tree problem ⋮ Fixed-parameter tractability results for full-degree spanning tree and its dual ⋮ The degree-preserving spanning tree problem in strongly chordal and directed path graphs ⋮ On the Directed Degree-Preserving Spanning Tree Problem
Cites Work
This page was built for publication:
