acyclic acyclicity adaptive adjusting algorithm algorithmic algorithms alternative amortized analysis ancestors applications applied approach approximation arbitrary aspects augmentation balance balanced biased biconnected biconnectivity binary bipartite bipolar boolean bottleneck bounded bounds branchings bridge bridges canceling certain checking chordality circuit circuits circulations class clique clustering combinatorial combinatorics common complete complexity componemts components compression computation computational computing conference connected connectivity curves cycles deadlines decomposition defense depth design digraphs dimensional directed disjoint dissection distance dividing dominators double dynamic earliness efficiency efficient elementary elimination enumeration exact faster fibonacci finding first flowgraph flows forest formulas functions general generalized genus geometry graph graphs hamiltonian hashing heaps heuristic hyperbolic hypergraphs improved independent inside intersection introductory isomorphism jordan layouts level linear linked lists locally location logarithmic lower maintain maintaining maintenance making manipulation matching mathematics maximum method methods minimization minimum models nearest negative nested network networks nonlinear notes numbering optimization optimum orientations oriented packing paging pairing pairs parallel parametric partition paths penalties perfect performance permutations persistent planar planarity plane point polygon polygons polynomial problem problems processor quantified queues quick randomized recognition rectilinear reduce reducibility refinement regional related relaxed release representing require resistance reversals rotation rules scaling scheduling scheme search selection selectively sensitivity separator separators sequences series shortest signed simple simpler social software solving sorted sorting space spanning sparse special stacks storing structure structures subexpression successive survey symmetric synthesis systems table tamper tardiness tasks techniques testing their theorem three times trees triangulated triangulating triangulations triconnected truth undirected unified union update upper using variations verification vertex visibility volume which worst