Pages that link to "Item:Q672487"

The following pages link to Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487):

Displaying 9 items.

• Finding clubs in graph classes (Q400518) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
• Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
• Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
• Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices (Q1886361) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
• On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)