Reverse search for enumeration
From MaRDI portal
Publication:1917258
DOI10.1016/0166-218X(95)00026-NzbMath0854.68070DBLPjournals/dam/AvisF96WikidataQ56506110 ScholiaQ56506110MaRDI QIDQ1917258
Publication date: 13 January 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Related Items (only showing first 100 items - show all)
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ A research on related properties of hybrid benzenoid system ⋮ Multivariate Estimator for Linear Dynamical Systems with Additive Laplace Measurement and Process Noises ⋮ Proximity Search for Maximal Subgraph Enumeration ⋮ Enumerating non-crossing minimally rigid frameworks ⋮ Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs ⋮ Constant Time Enumeration by Amortization ⋮ Enumeration, Counting, and Random Generation of Ladder Lotteries ⋮ Output-sensitive cell enumeration in hyperplane arrangements ⋮ Closed and noise-tolerant patterns in \(n\)-ary relations ⋮ On planar path transformation ⋮ From the zonotope construction to the Minkowski addition of convex polytopes ⋮ ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS ⋮ SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS ⋮ A polynomial case of the cardinality-constrained quadratic optimization problem ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ A class of optimization problems motivated by rank estimators in robust regression ⋮ Enumeration of irredundant forests ⋮ Constant amortized time enumeration of Eulerian trails ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality ⋮ The Polyhedral Geometry of Pivot Rules and Monotone Paths ⋮ Global CLF Stabilization of Nonlinear Systems. Part II: An Approximation Approach---Closed CVS ⋮ Unmixing the mixed volume computation ⋮ Transformations for maximal planar graphs with minimum degree five ⋮ Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ Family Trees for Enumeration ⋮ Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs ⋮ Polynomial-delay enumeration algorithms in set systems ⋮ Partial identification in nonseparable binary response models with endogenous regressors ⋮ On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints ⋮ Unnamed Item ⋮ Pattern search in the presence of degenerate linear constraints ⋮ A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search ⋮ Nonparametric Maximum Likelihood Methods for Binary Response Models With Random Coefficients ⋮ Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns ⋮ Efficient algorithms for dualizing large-scale hypergraphs ⋮ An Efficient Algorithm for Enumerating Pseudo Cliques ⋮ A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization ⋮ Antimatroids and balanced pairs ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ The fundamental theorem of linear programming: extensions and applications ⋮ Efficient mode enumeration of compositional hybrid systems ⋮ On Fast Enumeration of Pseudo Bicliques ⋮ Notes on the Twisted Graph ⋮ Counting Plane Graphs with Exponential Speed-Up ⋮ Enumerating Minimal Transversals of Hypergraphs without Small Holes ⋮ Methodology for competitive strategy development ⋮ Parallel Enumeration of Lattice Animals ⋮ On local transformations in plane geometric graphs embedded on small grids ⋮ Listing All Plane Graphs ⋮ Listing Maximal Independent Sets with Minimal Space and Bounded Delay ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Gray code enumeration of plane straight-line graphs ⋮ COMPUTING THE GIT-FAN ⋮ INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY ⋮ ON FLIPS IN POLYHEDRAL SURFACES ⋮ Enumerating the \(k\) best plane spanning trees ⋮ Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. ⋮ \(h\)-assignments of simplicial complexes and reverse search ⋮ Notes on acyclic orientations and the shelling lemma ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ On the gap between the quadratic integer programming problem and its semidefinite relaxation ⋮ Hamilton cycles in the path graph of a set of points in convex position ⋮ Computing Gröbner fans ⋮ On the number of rectangulations of a planar point set ⋮ DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES ⋮ Unnamed Item ⋮ Enumerating triangulation paths ⋮ Extended convex hull ⋮ Unnamed Item ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ Random Generation and Enumeration of Proper Interval Graphs ⋮ Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs ⋮ Parameterized Enumeration for Modification Problems ⋮ Multiparametric linear programming with applications to control ⋮ Generating all distributions of objects to bins ⋮ Enumerating connected induced subgraphs: improved delay and experimental comparison ⋮ Transition operations over plane trees ⋮ Flip distances between graph orientations ⋮ The Newton polytope of the discriminant of a quaternary cubic form ⋮ Efficient Contact Mode Enumeration in 3D ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ An Implementation of Exact Mixed Volume Computation ⋮ Generating all vertices of a polyhedron is hard ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets ⋮ On the Number of p4-Tilings by an n-Omino ⋮ Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees ⋮ On directed-convex polyominoes in a rectangle ⋮ Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices ⋮ Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs ⋮ A Portable Parallel Implementation of the lrs Vertex Enumeration Code ⋮ Unnamed Item ⋮ Escape from the room
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial face enumeration in arrangements and oriented matroids
- Bounding the number of \(k\)-faces in arrangements of hyperplanes
- A basis enumeration algorithm for linear systems with geometric applications
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A flexible algorithm for generating all the spanning trees in undirected graphs
- A structured program to generate all topological sorting arrangements
- Submodular functions and optimization.
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Generating Linear Extensions Fast
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- Partition of Space
This page was built for publication: Reverse search for enumeration
