3471 search results - page 454 / 695 » Obstacle Numbers of Graphs |
148
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
168
click to vote
DGCI
2009
Springer
15 years 10 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
176
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
192
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
225
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...