On graphs with unique node labels

DOI10.1007/3-540-45028-9_2MaRDI QIDQ4450785zbMATH OpenFDO

Authors Peter J. C. Dickinson, Arek Dadej, Miro Kraetzl, Horst Bunke

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260013.htm

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Matching graphs with unique node labels
• scientific article; zbMATH DE number 3863252
• scientific article; zbMATH DE number 969104
• On uniquely intersectable graphs
• A note on labeling of graphs
• On a labeling problem in graphs
• The unique -min labelings of graphs
• A note on labelings of graphs
• scientific article; zbMATH DE number 4087709
• scientific article; zbMATH DE number 4070955

Cited in

(5)

• Improving bipartite graph edit distance approximation using various search strategies
• On the maximum density of graphs with unique-path labelings
• Improved Graph Edit Distance Approximation with Simulated Annealing
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover
• Matching graphs with unique node labels

This page was built for publication: On graphs with unique node labels

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