Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
From MaRDI portal
(Redirected from Publication:6546606)
Cites work
- A linear vertex kernel for Maximum Internal Spanning Tree
- Algorithms and Data Structures
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Complexities of some interesting problems on spanning trees
- Complexity of independency and cliquy trees
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Efficient Planarity Testing
- Fundamentals of parameterized complexity
- Graph theory
- scientific article; zbMATH DE number 5725105 (Why is no real title available?)
- scientific article; zbMATH DE number 2080206 (Why is no real title available?)
- Introduction to algorithms.
- Mathematical Foundations of Computer Science 2003
- On finding optimal and near-optimal lineal spanning trees
- On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Parameterized algorithms
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Spanning trees with pairwise nonadjacent endvertices
- The DFS-heuristic for orthogonal graph drawing
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Trémaux trees and planarity
- Trémaux trees and planarity
Cited in
(3)
This page was built for publication: Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546606)
