Efficient Matching for Column Intersection Graphs
DOI10.1145/2616587zbMath1347.68352OpenAlexW1988233412WikidataQ125910636 ScholiaQ125910636MaRDI QIDQ2828179
Rob H. Bisseling, B. O. Fagginger Auer
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/307294
Nonnumerical algorithms (68W05) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple approximation algorithm for the weighted matching problem
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- The university of Florida sparse matrix collection
- An Efficient Heuristic Procedure for Partitioning Graphs
- Faster scaling algorithms for general graph matching problems
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Paths, Trees, and Flowers
- Engineering Algorithms for Approximate Weighted Matching
- Maximum matching and a polyhedron with 0,1-vertices
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Efficient Matching for Column Intersection Graphs
