Weighted connected matchings
From MaRDI portal
Publication:6163963
DOI10.1007/978-3-031-20624-5_4arXiv2202.04746MaRDI QIDQ6163963
Vinícius Fernandes dos Santos, Guilherme C. M. Gomes, Jayme Luiz Szwarcfiter, Paulo Eustáquio Duarte Pinto, Bruno Porto Masquio
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.04746
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parameterized complexity of the induced matching problem
- Induced matchings
- Degenerate matchings and edge colorings
- 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
- Generalized subgraph-restricted matchings in graphs
- On maximum induced matchings in bipartite graphs
- Maximum weight induced matching in some subclasses of bipartite graphs
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- On some hard and some tractable cases of the maximum acyclic matching problem
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Graph minors. II. Algorithmic aspects of tree-width
- Planar Formulae and Their Uses
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Graph Classes: A Survey
- Scaling Algorithms for Weighted Matching in General Graphs
- Reducibility among Combinatorial Problems
- Acyclic Matching in Some Subclasses of Graphs
- Paths, Trees, and Flowers
- Parameterized Algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- Disconnected matchings
- Uniquely restricted matchings
This page was built for publication: Weighted connected matchings
