Pages that link to "Item:Q1392565"

The following pages link to Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565):

Displaying 21 items.

• Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
• On some graphs with a unique perfect matching (Q1799576) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
• (Q5002753) (← links)
• (Q5090996) (← links)
• (Q5091230) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
• A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
• Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)