Pages that link to "Item:Q1805124"
From MaRDI portal
The following pages link to Algorithmic aspects of bipartite graphs (Q1805124):
Displaying 9 items.
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Chordal bipartite graphs and crowns (Q1071029) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs (Q2907957) (← links)
- Algorithm Engineering for Optimal Graph Bipartization (Q3627967) (← links)
- (Q4511030) (← links)
- (Q4551374) (← links)
- Experimental and Efficient Algorithms (Q5710023) (← links)
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434) (← links)