scientific article; zbMATH DE number 1792682
From MaRDI portal
Publication:4552272
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
Cited in
(39)- Gray codes for column-convex polyominoes and a new class of distributive lattices
- On finding optimal and near-optimal lineal spanning trees
- Generating permutations with given ups and downs
- The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
- On generating \(k\)-ary trees in computer representation
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- A loopless algorithm for generating the permutations of a multiset
- The number and probability of canalizing functions
- A loop-free algorithm for generating the linear extensions of a poset
- Gap strings and spanning forests for bridge graphs of biconnected graphs
- Restricted compositions and permutations: from old to new Gray codes
- Mathematical analysis and solutions for multi-objective line-cell conversion problem
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
- scientific article; zbMATH DE number 1805583 (Why is no real title available?)
- Determining when a graphic matroid is transversal in linear time
- Combinatorial properties of some classes of matrices over GF(2)
- The discovery and enumeration of representative symbols for circulant tournaments
- Ranking and unranking planar embeddings
- The generalized column incidence graph and a matroid base-listing algorithm
- Full transversal matroids, strict gammoids, and the matroid components problem
- Menus of kuratowski subgraphs
- A matrix characterization of induced paths in bridge graphs
- A matrix analysis of carrier posets of biconnected graphs
- Canonical forms for cycles in bridge graphs
- A new iterative numerical solution algorithm for a class of stochastic Petri nets
- Bijective comparison of optimal planarity algorithms
- scientific article; zbMATH DE number 863509 (Why is no real title available?)
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- Cross-bifix-free sets in two dimensions
- The two basic linear time Planarity algorithms: Are they the same?
- On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
- Ergodicity of the Fisher infinitesimal model with quadratic selection
- High-order, multidimensional, and conservative coarse-fine interpolation for adaptive mesh refinement
- Enumeration of acyclic walks in a graph
- On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves
- Gray code orders for \(q\)-ary words avoiding a given factor
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4552272)
