Finding maximum matchings in RDV graphs efficiently
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Characterizations of strongly chordal graphs
- Comparability graphs and intersection graphs
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Computing the \(K\)-terminal reliability of directed path graphs
- Counting maximal independent sets in directed path graphs
- Design and implementation of an efficient priority queue
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Finding a maximum matching in a circular-arc graph
- Finding a maximum matching in a permutation graph
- Intersection graphs of paths in a tree
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Matching theory
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Path minima queries in dynamic weighted trees
- Priority Search Trees
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The vertex leafage of chordal graphs
This page was built for publication: Finding maximum matchings in RDV graphs efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847361)
