Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
From MaRDI portal
Publication:4075503
DOI10.1002/net.1975.5.3.237zbMath0316.05125MaRDI QIDQ4075503
Ronald C. Read, Robert Endre Tarjan
Publication date: 1975
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.1975.5.3.237
Related Items
An Efficient Algorithm for Enumerating Pseudo Cliques, Generating all vertices of a polyhedron is hard, Signsolvability revisited, On the succinct representation of graphs, Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, Generating cut conjunctions in graphs and related problems, Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, Generating 3-vertex connected spanning subgraphs, Listing minimal edge-covers of intersecting families with applications to connectivity problems, Identifying the structure of cycling in ecosystems, An algorithm for the enumeration of spanning trees, Recognizing max-flow min-cut path matrices, On generating all maximal independent sets, On a cycle finding algorithm, Enumerating the cycles of a digraph: a new preprocessing strategy, Cycle detection in critical path networks, Characterizations of outerplanar graphs, Concave cost minimization on networks, Efficient enumeration of the vertices of polyhedra associated with network LP's, Generating all maximal independent sets on trees in lexicographic order, An inequality for polymatroid functions and its applications., Finding all the negative cycles in a directed graph, The problem of the optimal biobjective spanning tree, Logical analysis of data with decomposable structures., A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs, Dual-bounded generating problems: Weighted transversals of a hypergraph, Heuristic and exact algorithms for the spanning tree detection problem, Reverse search for enumeration, On enumerating minimal dicuts and strongly connected subgraphs, New algorithm for generation of spanning trees, A search strategy for the elementary cycles of a directed graph, Analyse und Synthese zuverlässiger Netze
