Algebraic tools for the construction of colored flows with boundary constraints

DOI10.1051/ita:2004011zbMath1060.05055OpenAlexW1995213731MaRDI QIDQ4825396

Eric Rémila, Marius Dorkenoo, Marie-Christine Eglin-Leclerc

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsflowmulticommodity flow

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A polyomino tiling problem of Thurston and its configurational entropy
• Tiling with polyominoes and combinatorial group theory
• Kac-Moody symmetries of critical ground states
• Conway's Tiling Groups
• An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
• A Pedestrian Approach to a Method of Conway, or, A Tale of Two Cities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic tools for the construction of colored flows with boundary constraints