scientific article; zbMATH DE number 1792682
From MaRDI portal
Publication:4552272
zbMath1003.05001MaRDI QIDQ4552272
Publication date: 29 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)
Related Items (37)
A loopless algorithm for generating the permutations of a multiset ⋮ On the loopless generation of binary tree sequences ⋮ The number and probability of canalizing functions ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Ranking and unranking planar embeddings ⋮ On finding optimal and near-optimal lineal spanning trees ⋮ A trace partitioned Gray code forq-ary generalized Fibonacci strings ⋮ A matrix characterization of induced paths in bridge graphs ⋮ The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices ⋮ The generalized column incidence graph and a matroid base-listing algorithm ⋮ Full transversal matroids, strict gammoids, and the matroid components problem ⋮ A loop-free algorithm for generating the linear extensions of a poset ⋮ Bijective comparison of optimal planarity algorithms ⋮ Gap strings and spanning forests for bridge graphs of biconnected graphs ⋮ Determining when a graphic matroid is transversal in linear time ⋮ 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 ⋮ A matrix analysis of carrier posets of biconnected graphs ⋮ Canonical forms for cycles in bridge graphs ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Menus of kuratowski subgraphs ⋮ High-order, multidimensional, and conservative coarse-fine interpolation for adaptive mesh refinement ⋮ A new iterative numerical solution algorithm for a class of stochastic Petri Nets ⋮ Generating permutations with given ups and downs ⋮ Cross-bifix-free sets in two dimensions ⋮ Enumeration of acyclic walks in a graph ⋮ A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS ⋮ The two basic linear time Planarity algorithms: Are they the same? ⋮ Combinatorial properties of some classes of matrices over GF(2) ⋮ The discovery and enumeration of representative symbols for circulant tournaments ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Gray codes for column-convex polyominoes and a new class of distributive lattices ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees. ⋮ Mathematical analysis and solutions for multi-objective line-cell conversion problem
This page was built for publication:
