Pages that link to "Item:Q1893159"
From MaRDI portal
The following pages link to The arborescence-realization problem (Q1893159):
Displaying 11 items.
- On finding solutions for extended Horn formulas (Q673602) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Around the Danzer problem and the construction of dense forests (Q2154802) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- An Almost Linear-Time Algorithm for Graph Realization (Q3800056) (← links)
- The Gilbert arborescence problem (Q5326792) (← links)