The maximum degree and diameter-bounded subgraph in the mesh

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F12%3A43915988" target="_blank" >RIV/49777513:23520/12:43915988 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2012.03.035" target="_blank" >http://dx.doi.org/10.1016/j.dam.2012.03.035</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2012.03.035" target="_blank" >10.1016/j.dam.2012.03.035</a>

Result language
angličtina
Original language name
The maximum degree and diameter-bounded subgraph in the mesh
Original language description
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree d and the diameter D, was introduced by Dekker et al. in 2012, as a generalization of the Degree-Diameter Problem. A caseof special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide some general bounds for the order of the largest subgraph in arbitrary dimension k, and for the particular cases of k = 3, d = 4 and k = 2, d = 3, we give constructions that result in sharper lower bounds.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)