Polynomial-delay and polynomial-space enumeration of large maximal matchings
From MaRDI portal
Publication:6039434
DOI10.1007/978-3-031-15914-5_25arXiv2105.04146OpenAlexW4312785567MaRDI QIDQ6039434
Yasuaki Kobayashi, Kunihiro Wasa, Kazuhiro Kurita
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.04146
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Generating cut conjunctions in graphs and related problems
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Algorithms for finding k-best perfect matchings
- On generating all maximal independent sets
- On enumerating all minimal solutions of feedback problems
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Reverse search for enumeration
- Extension of some edge graph problems: standard and parameterized complexity
- Constant Time Enumeration by Amortization
- Finding all minimum-cost perfect matchings in Bipartite graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- Algorithm Theory - SWAT 2004
- Paths, Trees, and Flowers
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Algorithms – ESA 2004
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Optimal Listing of Cycles and st-Paths in Undirected Graphs
- Encyclopedia of Algorithms
This page was built for publication: Polynomial-delay and polynomial-space enumeration of large maximal matchings
