Algorithms and Data Structures
From MaRDI portal
Publication:5900777
DOI10.1007/b11837zbMath1278.68109MaRDI QIDQ5900777
Elena Prieto, Christian Sloper
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (26)
A 2k-vertex Kernel for Maximum Internal Spanning Tree ⋮ Solving the maximum internal spanning tree problem on interval graphs in polynomial time ⋮ Scatter search for the minimum leaf spanning tree problem ⋮ A parameterized perspective on packing paths of length two ⋮ Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem ⋮ A simple linear time algorithm to solve the MIST problem on interval graphs ⋮ A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem ⋮ Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs ⋮ Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs ⋮ Improved Approximations for Hard Optimization Problems via Problem Instance Classification ⋮ An approximation algorithm for maximum internal spanning tree ⋮ Crown reductions for the minimum weighted vertex cover problem ⋮ Unnamed Item ⋮ Improved upper bounds for vertex cover ⋮ Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem ⋮ Complexity of independency and cliquy trees ⋮ Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree ⋮ The complexity ecology of parameters: An illustration using bounded max leaf number ⋮ Structural Properties of Hard Metric TSP Inputs ⋮ Approximation algorithms for the maximum weight internal spanning tree problem ⋮ Minimum leaf out-branching and related problems ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ Algorithms for maximum internal spanning tree problem for some graph classes
This page was built for publication: Algorithms and Data Structures
