scientific article; zbMATH DE number 1104328
From MaRDI portal
Publication:4370201
zbMATH Open0897.05066MaRDI QIDQ4370201FDOQ4370201
Authors: Takeaki Uno 
Publication date: 19 October 1998
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (33)
- Title not available (Why is that?)
- A fast algorithm to construct a representation for transversal matroids
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
- A constraint logic programming approach for generating all perfect matchings
- Algorithms – ESA 2004
- Heuristic enhancements of the search for the generation of all perfect matchings
- Finding all maximally-matchable edges in a bipartite graph
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Number of maximum matchings of bipartite graphs with positive surplus
- Title not available (Why is that?)
- Size versus truthfulness in the house allocation problem
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
- Traversing combinatorial 0/1-polytopes via optimization
- On the complexity of SNP block partitioning under the perfect phylogeny model
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
- Title not available (Why is that?)
- Solving matching problems efficiently in bipartite graphs
- A perfect matching algorithm for sparse bipartite graphs
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
- Title not available (Why is that?)
- Maximum matchings in bipartite graphs via strong spanning trees
- Fast enumeration algorithms for non-crossing geometric graphs
- Title not available (Why is that?)
- The parameterized complexity of some minimum label problems
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Enumerating perfect matchings in \(n\)-cubes
- Finding all minimum-cost perfect matchings in Bipartite graphs
- Polynomial-delay and polynomial-space enumeration of large maximal matchings
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Maximum matchings in scale-free networks with identical degree distribution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370201)
