199 search results - page 28 / 40 » Connectivity of addable graph classes |
102
Voted
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
104
click to vote
SIGCOMM
2009
ACM
15 years 7 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
115
click to vote
COMBINATORICA
2006
15 years 26 days ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
107
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
102
click to vote
JCSS
2000
15 years 18 days ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...