scientific article; zbMATH DE number 3383914

MaRDI QIDQ5653953zbMATH OpenFDO

Authors

Publication date 1972

zbMATH Keywords

ComputingGraph Theory

Mathematics Subject Classification ID

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)

Cited in

(19)

• On determining non-isotopic configurations of points on a circle
• Finding minimum height elimination trees for interval graphs in polynomial time
• XML compression via directed acyclic graphs
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• Graph Coloring Using Eigenvalue Decomposition
• One ModuloNGracefulness of Supersubdivision of Ladder
• Some sequential graph colouring algorithms
• Partitioning, tearing and modification of sparse linear systems
• Generating the Nine-Point Graphs
• A Note On Set-Indexed Graphs
• Set-Valued Graphs: A Survey
• Computing the maximal canonical form for trees in polynomial time
• Total difference chromatic numbers of graphs
• On even-odd meanness of super subdivision of some graphs
• Fitting very large sparse Gaussian graphical models
• A branch-price-and-cut algorithm for the minimum evolution problem
• On multiple grid and related techniques for solving discrete elliptic systems
• Automates finis et ensembles normaux. (Finite automata and normal sets)
• Strong tree-cographs are Birkhoff graphs

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 Q5653953)