Pages that link to "Item:Q6487434"

The following pages link to Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434):

Displaying 15 items.

• Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
• Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
• Listing all potential maximal cliques of a graph (Q1605302) (← links)
• On some graphs with a unique perfect matching (Q1799576) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← 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)
• A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• (Q5090996) (← links)
• (Q5091230) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)