scientific article; zbMATH DE number 3383914
From MaRDI portal
Publication:5653953
zbMath0243.00006MaRDI QIDQ5653953
No author found.
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx) Conference proceedings and collections of articles (00Bxx) Computer science (68-XX) Information and communication theory, circuits (94-XX)
Related Items (19)
XML compression via directed acyclic graphs ⋮ On even-odd meanness of super subdivision of some graphs ⋮ Finding minimum height elimination trees for interval graphs in polynomial time ⋮ Computing the maximal canonical form for trees in polynomial time ⋮ A branch-price-and-cut algorithm for the minimum evolution problem ⋮ One ModuloNGracefulness of Supersubdivision of Ladder ⋮ A Note On Set-Indexed Graphs ⋮ Set-Valued Graphs: A Survey ⋮ Strong tree-cographs are Birkhoff graphs ⋮ Graph Coloring Using Eigenvalue Decomposition ⋮ Fitting very large sparse Gaussian graphical models ⋮ Total difference chromatic numbers of graphs ⋮ Generating the Nine-Point Graphs ⋮ Graph Relabelling Systems ⋮ Partitioning, tearing and modification of sparse linear systems ⋮ Some sequential graph colouring algorithms ⋮ On multiple grid and related techniques for solving discrete elliptic systems ⋮ On determining non-isotopic configurations of points on a circle ⋮ Automates finis et ensembles normaux. (Finite automata and normal sets)
This page was built for publication:
