hopcroft and tarjan"dividing graph into triconnected components,siam journal on computing ( ) - hopcroft and tarjan"efficient planarity testing,journal of the acm ( ) - hopcroft and wong"linear-time algorithm for isomorphism of planar graphs,proceedings of the sixth annual acm symposium on theory of computing ( ) - johnson"efficient algorithms for shortest paths in sparse networks,journal of the acm ( ) - kahn"topological sorting of large networks,communications of the acm ( ) - kargerp kleinand tarjan" randomized linear-time algorithm to find minimum spanning trees,journal of the acm ( ) - karp"reducibility among combinatorial problems,complexity of computer computations (eds miller and thatcher)plenum pressnew york - karzanov"determining the maximal flow in network by the method of preflows,soviet mathematics doklady ( ) - kings raoand tarjan" faster deterministic maximum flow algorithm,journal of algorithms ( ) - knuththe art of computer programmingvol fundamental algorithms ed addison-wesleyreadingmass kruskaljr "on the shortest spanning subtree of graph and the traveling salesman problem,proceedings of the american mathematical society ( ) - kuhn"the hungarian method for the assignment problem,naval research logistics quarterly ( ) - lawlercombinatorial optimizationnetworks and matroidsholtreinhart and winstonnew york lin and kernighan"an effective heuristic algorithm for the traveling salesman problem,operations research ( ) - melhorndata structures and algorithms graph algorithms and np-completenessspringer-verlagberlin moret and shapiro"an empirical analysis of algorithms for constructing minimum spanning tree,proceedings of the second workshop on algorithms and data structures ( ) - orlin"max flows in (nmtimeor better,proceedings of the forty-fifth annual acm symposium on theory of computing ( papadimitriou and steiglitzcombinatorial optimizationalgorithms and complexityprentice hallenglewood cliffsn prim"shortest connection networks and some generalizations,bell system technical journal ( ) - sharir" strong-connectivity algorithm and its application in data flow analysis,computers and mathematics with applications ( ) - tarjan"depth first search and linear graph algorithms,siam journal on computing ( ) -