Concepedia
Theoretical Computer Science · 2008 · 43 citations · 22 references
ComputingVisualizationCombinatoricsDirected Acyclic GraphsGraph AlgorithmsGraph ColoringGraph DrawingGraph TheoryShortest Path AlgorithmsColoring Planar GraphsEdge Coloring
22
The directed subgraph homeomorphism problem
Steven Fortune, John E. Hopcroft, James Wyllie · Theoretical Computer Science · 1980 · 761 citations
Natural Sciences, Mathematics, Combinatorics +7
On the Computational Complexity of Combinatorial Problems
Richard M. Karp · Networks · 1975 · 712 citations
Computing, Computer Science, Mathematics +15
Data structures for weighted matching and nearest common ancestors with linking
Harold N. Gabow · Symposium on Discrete Algorithms · 1990 · 409 citations
Computing, Computer Science, Algorithms +13
Faster scaling algorithms for general graph matching problems
Harold N. Gabow, Robert E. Tarjan · Journal of the ACM · 1991 · 306 citations · Full text
Computing, Computer Science, Computational Geometry +6
On Two Problems in the Generation of Program Test Paths
Harold N. Gabow, Sachin Maheshwari, Leon J. Osterweil · IEEE Transactions on Software Engineering · 1976 · 196 citations
Computing, Computer Science, Algorithms +10