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