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

Cited in

(57)

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

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)