graph algorithms chazelle" minimum spanning tree algorithm with inverse-ackermann type complexity,journal of the acm ( ) - cheriton and tarjan"finding minimum spanning trees,siam journal on computing ( ) - cheriyan and hagerup" randomized maximum-flow algorithm,siam journal on computing ( ) - cook"the complexity of theorem proving procedures,proceedings of the third annual acm symposium on theory of computing ( ) - deograph theory with applications to engineering and computer scienceprentice hallenglewood cliffsn dijkstra" note on two problems in connexion with graphs,numerische mathematik ( ) - dinic"algorithm for solution of problem of maximum flow in networks with power estimation,soviet mathematics doklady ( ) - edmonds"pathstreesand flowers,canadian journal of mathematics ( ) - edmonds and karp"theoretical improvements in algorithmic efficiency for network flow problems,journal of the acm ( ) - evengraph algorithmscomputer science presspotomacmd fordjr and fulkersonflows in networksprinceton university pressprincetonn fredman and tarjan"fibonacci heaps and their uses in improved network optimization algorithms,journal of the acm ( ) - gabow"data structures for weighted matching and nearest common ancestors with linking,proceedings of first annual acm-siam symposium on discrete algorithms ( ) - gabowz galilt spencerand tarjan"efficient algorithms for finding minimum spanning trees on directed and undirected graphs,combinatorica ( ) - galil"efficient algorithms for finding maximum matchings in graphs,acm computing surveys ( ) - galil and tardos"an ( ( log nlog nmin-cost flow algorithm,journal of the acm ( ) - garey and johnsoncomputers and intractabilitya guide to the theory of np-completenessfreemansan francisco goldberg and rao"beyond the flow decomposition barrier,journal of the acm ( ) - goldberg and tarjan" new approach to the maximum-flow problem,journal of the acm ( ) - hararygraph theoryaddison-wesleyreadingmass hopcroft and karp"an / algorithm for maximum matchings in bipartite graphs,siam journal on computing ( ) - hopcroft and tarjan"algorithm efficient algorithms for graph manipulation,communications of the acm ( ) -