Flots et tensions dans un graphe

DOI10.24033/asens.1132zbMath0178.57603OpenAlexW2598805119MaRDI QIDQ5569395

Alain Ghouila-Houri

Publication date: 1964

Published in: Annales scientifiques de l'École normale supérieure (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ASENS_1964_3_81_3_267_0

zbMATH Keywords

topology

Related Items (13)

A strongly polynomial algorithm for the minimum cost tension problem ⋮ A faster strongly polynomial time algorithm to solve the minimum cost tension problem ⋮ Penelope's graph: a hard minimum cost tension instance ⋮ The adjacency matroid of a graph ⋮ An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem ⋮ Longest paths in digraphs ⋮ Unnamed Item ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ Comparability graphs and a new matroid ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Classification de certaines matrices 0-1 ⋮ To reorient is easier than to orient: An on-line algorithm for reorientation of graphs

Cites Work

• A structural characterization of planar combinatorial graphs
• A Class Of Abelian Groups
• Matroids and Graphs
• On maximal paths and circuits of graphs
• Monotone networks
• Some Combinatorial Lemmas in Topology
• Non-Separable and Planar Graphs
• Congruent Graphs and the Connectivity of Graphs
• Planar Graphs
• On the Abstract Properties of Linear Dependence
• Über reguläre Kettengruppen
• A Characterization of Comparability Graphs and of Interval Graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Flots et tensions dans un graphe