6598 search results - page 472 / 1320 » Graph Theory with Applications |
162
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
208
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
221
click to vote
MOBICOM
2006
ACM
16 years 25 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
206
click to vote
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
176
click to vote
EJC
2008
15 years 7 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...