scientific article; zbMATH DE number 6964093
From MaRDI portal
Publication:4691914
zbMath1506.05175MaRDI QIDQ4691914
Publication date: 24 October 2018
Full work available at URL: http://mathnet.ru/eng/timb242
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- 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
- NP-completeness of some generalizations of the maximum matching problem
- 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
- Node-Deletion Problems on Bipartite Graphs
- Bipartite Domination and Simultaneous Matroid Covers
- Depth-First Search and Linear Graph Algorithms
This page was built for publication:
