Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees

Cited In (57)

Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Fuzzy graphs in telecommunications: exploring average fuzzy cyclic connectivity for enhanced connectivity analysis
Traversing combinatorial 0/1-polytopes via optimization
Faster enumeration of all spanning trees of a directed graph
Enumerating \(m\)-length walks in directed graphs with constant delay
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
Enumerating models of DNF faster: breaking the dependency on the formula size
Incremental delay enumeration: space and time
On the shortest path problem with negative cost cycles
Listing all spanning trees in Halin graphs — sequential and Parallel view
Title not available (Why is that?)
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Dual-bounded generating problems: Weighted transversals of a hypergraph
Recognizing max-flow min-cut path matrices
Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)
An Efficient Algorithm for Enumerating Pseudo Cliques
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
The problem of the optimal biobjective spanning tree
Generating all maximal independent sets on trees in lexicographic order
On enumerating minimal dicuts and strongly connected subgraphs
Monadic second-order model-checking on decomposable matroids
Generating all vertices of a polyhedron is hard
Heuristic and exact algorithms for the spanning tree detection problem
Signsolvability revisited
An efficient algorithm for solving pseudo clique enumeration problem
Characterizations of outerplanar graphs
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Memory-efficient enumeration of constrained spanning trees
On the succinct representation of graphs
Generating 3-vertex connected spanning subgraphs
Concave cost minimization on networks
Linearizable special cases of the quadratic shortest path problem
Listing minimal edge-covers of intersecting families with applications to connectivity problems
Cycle detection in critical path networks
On a cycle finding algorithm
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
An inequality for polymatroid functions and its applications.
Algorithms for generating convex sets in acyclic digraphs
On generating all maximal independent sets
A search strategy for the elementary cycles of a directed graph
Reverse search for enumeration
Probabilistic and exact frequent subtree mining in graphs beyond forests
Enumerating the cycles of a digraph: a new preprocessing strategy
Generating cut conjunctions in graphs and related problems
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
Mining preserving structures in a graph sequence
Identifying the structure of cycling in ecosystems
The negative cycles polyhedron and hardness of checking some polyhedral properties
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
Finding all the negative cycles in a directed graph
Analyse und Synthese zuverlässiger Netze
Title not available (Why is that?)
Efficient enumeration of the vertices of polyhedra associated with network LP's
New algorithm for generation of spanning trees
Logical analysis of data with decomposable structures.
An algorithm for the enumeration of spanning trees

This page was built for publication: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075503)