Back to search
Finding Steiner forests in planar graphs
Data up to Jan 2025
Published1990
Citations23
References7
Total Citations Per Year
Abstract
References (7)
Maximal Flow Through a Network
2009 • 1,942 citations
Steiner problem in networks: a survey
1987 • 586 citations
Network Flow and Testing Graph Connectivity
1975 • 554 citations
The equivalence of theorem proving and the interconnection problem
1975 • 155 citations
Graph minors. VI. Disjoint paths across a disc
1986 • 103 citations
Algorithms for multicommodity flows in planar graphs
1989 • 9 citations
Multicommodity flows in planar undirected graphs and shortest paths
1985 • 5 citations
Cited By (0)
Loading...