From amortized to worst case delay in enumeration algorithms
From MaRDI portal
Cites work
- Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
- An efficient search algorithm to find the elementary circuits of a graph
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Computing and listing \(st\)-paths in public transportation networks
- Constant time enumeration by amortization
- Efficient algorithms for dualizing large-scale hypergraphs
- Efficient enumeration of solutions produced by closure operations
- Efficient generation of the binary reflected gray code and its applications
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Enumeration complexity
- First-order queries on structures of bounded degree are computable with constant delay
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Geometric amortization of enumeration algorithms
- scientific article; zbMATH DE number 5548206 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 6829393 (Why is no real title available?)
- scientific article; zbMATH DE number 7075879 (Why is no real title available?)
- Incremental delay enumeration: space and time
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Mathematical recreations
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the Complexity of Some Enumeration Problems for Matroids
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
- Polynomial delay algorithm for minimal chordal completions
- Reverse search for enumeration
- Self-reducibility
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Time bounded random access machines
This page was built for publication: From amortized to worst case delay in enumeration algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318019)
