Pages that link to "Item:Q4075503"
From MaRDI portal
The following pages link to Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees (Q4075503):
Displaying 50 items.
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- Signsolvability revisited (Q795898) (← links)
- On the succinct representation of graphs (Q800734) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion (Q954963) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Identifying the structure of cycling in ecosystems (Q1052965) (← links)
- An algorithm for the enumeration of spanning trees (Q1082082) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- On a cycle finding algorithm (Q1144940) (← links)
- Enumerating the cycles of a digraph: a new preprocessing strategy (Q1172396) (← links)
- Cycle detection in critical path networks (Q1249558) (← links)
- Characterizations of outerplanar graphs (Q1255015) (← links)
- Concave cost minimization on networks (Q1257417) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Finding all the negative cycles in a directed graph (Q1602697) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- The problem of the optimal biobjective spanning tree (Q1806877) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- New algorithm for generation of spanning trees (Q3033347) (← links)
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
- A search strategy for the elementary cycles of a directed graph (Q4096432) (← links)
- Analyse und Synthese zuverlässiger Netze (Q4196224) (← links)
- Listing all spanning trees in Halin graphs — sequential and Parallel view (Q4603872) (← links)
- (Q5005188) (← links)
- (Q5009558) (← links)
- Faster enumeration of all spanning trees of a directed graph (Q5057454) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
