On the coding of ordered graphs

DOI10.1007/BF02684448MaRDI QIDQ1266307zbMATH OpenFDO

Authors Xiaoyi Jiang, Horst Bunke

Publication date 9 May 1999

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

isomorphismordered graphcoding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• scientific article; zbMATH DE number 3952822
• scientific article; zbMATH DE number 1839469
• An Introduction to Coding Sequences of Graphs
• scientific article; zbMATH DE number 2032369
• On the subtree isomorphism problem for ordered trees

Cites work

• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 3390780 (Why is no real title available?)
• A V log V algorithm for isomorphism of triconnected planar graphs
• An Algorithm for Subgraph Isomorphism
• Further annotated bibliography on the isomorphism disease
• Graph isomorphism is in the low hierarchy
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• The graph isomorphism disease

Cited in

(4)

• Network coding in undirected graphs is either very helpful or not helpful at all
• scientific article; zbMATH DE number 3952822 (Why is no real title available?)
• An Introduction to Coding Sequences of Graphs
• Proper and unit bitolerance orders and graphs

This page was built for publication: On the coding of ordered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266307)