About: The maximum degree and diameter-bounded subgraph in the mesh     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 case of 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.
  • 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 case of 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. (en)
Title
  • The maximum degree and diameter-bounded subgraph in the mesh
  • The maximum degree and diameter-bounded subgraph in the mesh (en)
skos:prefLabel
  • The maximum degree and diameter-bounded subgraph in the mesh
  • The maximum degree and diameter-bounded subgraph in the mesh (en)
skos:notation
  • RIV/49777513:23520/12:43915988!RIV13-MSM-23520___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I
http://linked.open...iv/cisloPeriodika
  • 12
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 148794
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/12:43915988
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Delannoy numbers; mesh; parallel architectures; degree-diameter problem; network design (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [ABC5E09E944F]
http://linked.open...i/riv/nazevZdroje
  • DISCRETE APPLIED MATHEMATICS
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 160
http://linked.open...iv/tvurceVysledku
  • Miller, Mirka
  • Ryan, Joe
  • Pérez-Rosés, Hebert
http://linked.open...ain/vavai/riv/wos
  • 000305260600012
issn
  • 0166-218X
number of pages
http://bibframe.org/vocab/doi
  • 10.1016/j.dam.2012.03.035
http://localhost/t...ganizacniJednotka
  • 23520
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software