Free partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces
Alexander Schrijver

TL;DR
This paper presents a polynomial-time algebraic method using cohomology over nonabelian graph groups to solve path and circuit problems in directed graphs on surfaces, extending to surfaces beyond the plane.
Contribution
It introduces a novel algebraic cohomology-based approach for path problems in directed graphs on surfaces, generalizing previous methods and providing polynomial algorithms.
Findings
Polynomial-time algorithm for disjoint paths in planar directed graphs.
Extension of the method to graphs on arbitrary orientable surfaces.
Algebraic cohomology approach applicable to nonabelian graph groups.
Abstract
We show that for each fixed , the problem of finding pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces needed to cover all sources and sinks. Moreover, the method can be extended to any fixed compact orientable surface (instead of the plane) and to rooted trees (instead of paths). Our approach is algebraic and is based on cohomology over graph (nonabelian) groups. More precisely, let be a directed graph and let be a group. Call two function {\em cohomologous} if there exists a function such that for each arc . Now given a function we want to find a function cohomologous to such that each belongs to a prescribed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Algebraic structures and combinatorial models
