Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86097347" target="_blank" >RIV/61989100:27240/13:86097347 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s11786-013-0156-7" target="_blank" >http://dx.doi.org/10.1007/s11786-013-0156-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11786-013-0156-7" target="_blank" >10.1007/s11786-013-0156-7</a>
Alternative languages
Result language
angličtina
Original language name
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
Original language description
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local approach that covers a graph by small subgraphs, so-called partial star products, and then utilizes this information to derive the global factors and an embedding of the graph under investigation into Cartesian product graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematics in Computer Science
ISSN
1661-8270
e-ISSN
—
Volume of the periodical
7
Issue of the periodical within the volume
3
Country of publishing house
CH - SWITZERLAND
Number of pages
19
Pages from-to
255-273
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84886780429