scientific article; zbMATH DE number 6964064
From MaRDI portal
Publication:4691905
zbMath1432.05081MaRDI QIDQ4691905
Publication date: 24 October 2018
Full work available at URL: http://mathnet.ru/eng/timb233
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Induced matchings in bipartite graphs
- The parameterized complexity of the induced matching problem
- Some results on graphs without long induced paths
- Brambles and independent packings in chordal graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- NP-completeness of some generalizations of the maximum matching problem
- Treewidth. Computations and approximations
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- The complexity of dissociation set problems in graphs
- NP-hard graph problems and boundary classes of graphs
- Independent packings in structured graphs
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Node-Deletion Problems on Bipartite Graphs
- Bipartite Domination and Simultaneous Matroid Covers
- Linear-time computation of optimal subgraphs of decomposable graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Treewidth: Structure and Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication:
