A metric for graphs
Vladimír Baláž; Jaroslav Koča; Vladimír Kvasnička; Milan Sekanina
Časopis pro pěstování matematiky (1986)
- Volume: 111, Issue: 4, page 431-433
- ISSN: 0528-2195
Access Full Article
top
How to cite
topBaláž, Vladimír, et al. "A metric for graphs." Časopis pro pěstování matematiky 111.4 (1986): 431-433. <http://eudml.org/doc/21656>.
@article{Baláž1986,
author = {Baláž, Vladimír, Koča, Jaroslav, Kvasnička, Vladimír, Sekanina, Milan},
journal = {Časopis pro pěstování matematiky},
keywords = {distance; maximal common subgraph; metric for graphs},
language = {eng},
number = {4},
pages = {431-433},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {A metric for graphs},
url = {http://eudml.org/doc/21656},
volume = {111},
year = {1986},
}
TY - JOUR
AU - Baláž, Vladimír
AU - Koča, Jaroslav
AU - Kvasnička, Vladimír
AU - Sekanina, Milan
TI - A metric for graphs
JO - Časopis pro pěstování matematiky
PY - 1986
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 111
IS - 4
SP - 431
EP - 433
LA - eng
KW - distance; maximal common subgraph; metric for graphs
UR - http://eudml.org/doc/21656
ER -
References
top- V. Kvasnička M. Kratochvíl J. Koča, Reaсtiоn Graphs, Cоlleсt. Czeсh. Chem. Cоmmun. 48 (1983) 2284. (1983)
- B. Zelinka, On a Certain Distanсe Вetween Isоmоrphism Classes оf Graphs, Čas. pӗst. mat. 100 (1975) 371. (1975) MR0416995
- J. J. McGregor, Baсktraсk Searсh Algоrithm and the Maximal Cоmmоn Subgraph Pгоblem, Sоftware Praсt. Exper. 12 (1982) 23. (1982)
Citations in EuDML Documents
top- Bohdan Zelinka, Distances between directed graphs
- Gary Chartrand, Heather Gavlas, Héctor Hevia, Mark A. Johnson, Rotation and jump distances between graphs
- Michal Šabo, On a maximal distance between graphs
- Vladimír Baláž, Vladimír Kvasnička, Jiří Pospíchal, Dual approach to edge distance between graphs
- Bohdan Zelinka, Edge-distance between isomorphism classes of graphs
- Bohdan Zelinka, The distance between various orientations of a graph
- Bohdan Zelinka, Contraction distance between isomorphism classes of graphs
- Bohdan Zelinka, Distances between partially ordered sets
- Bohdan Zelinka, Equivalences between isomorphism classes on infinite graphs
- Gerhard Benadé, Wayne Goddard, Terry A. McKee, Paul A. Winter, On distances between isomorphism classes of graphs
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.