The following pages link to Flots et tensions dans un graphe (Q5569395):
Displaying 11 items.
- The adjacency matroid of a graph (Q396844) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- Longest paths in digraphs (Q1165864) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
