Reverse search for enumeration

From MaRDI portal

Publication:1917258

Jump to:navigation, search

DOI10.1016/0166-218X(95)00026-NzbMath0854.68070WikidataQ56506110 ScholiaQ56506110MaRDI QIDQ1917258

Komei Fukuda, David Avis

Publication date: 13 January 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

reverse search technique

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Related Items

Reconstruction of the path graph, A linear optimization oracle for zonotope computation, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph, A lower bound on the number of triangulations of planar point sets, FPT algorithms to enumerate and count acyclic and totally cyclic orientations, Memory-efficient enumeration of constrained spanning trees, Enumeration of support-closed subsets in confluent systems, Computational approaches for zero forcing and related problems, Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases, Reverse search for monomial ideals, A branch-price-and-cut algorithm for the minimum evolution problem, An efficient algorithm for solving pseudo clique enumeration problem, Efficient enumeration of graph orientations with sources, Efficiently enumerating all maximal cliques with bit-parallelism, On the number of anchored rectangle packings for a planar point set, Mining preserving structures in a graph sequence, Parallel enumeration of triangulations, A survey on enhanced subspace clustering, New semidefinite programming relaxations for box constrained quadratic program, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, An improved test set approach to nonlinear integer problems with applications to engineering design, Enhancements on the hyperplanes arrangements in mixed-integer programming techniques, Enumerating minimal dominating sets in chordal bipartite graphs, Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}, Multi-way set enumeration in weight tensors, Efficiently mining \(\delta \)-tolerance closed frequent subgraphs, On zero duality gap in nonconvex quadratic programming problems, A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization, Connecting a set of circles with minimum sum of radii, Efficient view point selection for silhouettes of convex polyhedra, Amortized efficiency of generating planar paths in convex position, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, Efficient enumeration of ordered trees with \(k\) leaves, Output-polynomial enumeration on graphs of bounded (local) linear MIM-width, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, The biplanar tree graph, Reachability determination in acyclic Petri nets by cell enumeration approach, Efficient counting of degree sequences, The negative cycles polyhedron and hardness of checking some polyhedral properties, On duality gap in binary quadratic programming, Detecting anomaly collections using extreme feature ranks, Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction, New bounds on the unconstrained quadratic integer programming problem, Setting port numbers for fast graph exploration, Faradžev Read-type enumeration of non-isomorphic CC systems, On polyhedral projection and parametric programming, Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, A polynomial case of convex integer quadratic programming problems with box integer constraints, Enumerating models of DNF faster: breaking the dependency on the formula size, Efficiently enumerating minimal triangulations, Maximal strongly connected cliques in directed graphs: algorithms and bounds, Efficient enumeration of dominating sets for sparse graphs, Algorithmic enumeration of surrounding polygons, Enumerating constrained non-crossing minimally rigid frameworks, Algorithms for media, Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs, On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data, Flips in planar graphs, Code for polyomino and computer search of isospectral polyominoes, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Cell-and-bound algorithm for chance constrained programs with discrete distributions, Identification of unidentified equality constraints for integer programming problems, Optimal complexity reduction of polyhedral piecewise affine systems, On reduction of duality gap in quadratic knapsack problems, Efficient enumeration of all ladder lotteries and its application, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, On listing, sampling, and counting the chordal graphs with edge constraints, Planar tree transformation: results and counterexample, On the diameter of geometric path graphs of points in convex position, Parametric Lagrangian dual for the binary quadratic programming problem, Enumerating pseudo-triangulations in the plane, Incremental delay enumeration: space and time, A fast discovery algorithm for large common connected induced subgraphs, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number, An improved upper bound on maximal clique listing via rectangular fast matrix multiplication, Computing monotone disjoint paths on polytopes, Isolating points by lines in the plane, Generalized pattern search methods for a class of nonsmooth optimization problems with structure, Generating rooted triangulations without repetitions, On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, An occurrence of multiple projections in DEA-based measurement of technical efficiency: theoretical comparison among DEA models from desirable properties, Enumeration aspects of maximal cliques and bicliques, Transforming spanning trees: A lower bound, Geometric tree graphs of points in convex position, Counting polycubes without the dimensionality curse, Transforming spanning trees and pseudo-triangulations, On local transformation of polygons with visibility properties., Counting triangulations and other crossing-free structures approximately, An efficient algorithm for enumeration of triangulations, Boundary uniqueness of fusenes, Tabu search and finite convergence, A duality theorem for the ic-resurgence of edge ideals, Counting triangulations and other crossing-free structures via onion layers, Estimating the number of vertices of a polyhedron, Escape from the room, Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks, Enumerating floorplans with walls, Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes, Detection of common subtrees with identical label distribution, Combinatorial generation via permutation languages. III: Rectangulations, Transportation Problem Allowing Sending and Bringing Back, Reconfiguration and enumeration of optimal cyclic ladder lotteries, A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs, Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs, Quantum algorithms for learning hidden strings with applications to matroid problems, Unnamed Item, 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

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1917258&oldid=14335655"