Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

An algorithm for optimal isomorphism between two random graphs

From MaRDI portal
Publication:4301315
Jump to:navigation, search

DOI10.1016/0167-8655(94)90079-5zbMath0810.68106OpenAlexW2002668640MaRDI QIDQ4301315

Kyu Ho Park, Hosung Kim, Young Kyu Choi, Dong Su Seong

Publication date: 21 July 1994

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(94)90079-5


zbMATH Keywords

entropyrandom graphsgraph isomorphismstate-space search problem


Mathematics Subject Classification ID

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








This page was built for publication: An algorithm for optimal isomorphism between two random graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4301315&oldid=18236638"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 19:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki