2503 search results - page 59 / 501 » A study of 3-arc graphs |
163
click to vote
FCT
2009
Springer
16 years 14 days ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
142
click to vote
SIGCOMM
2009
ACM
16 years 12 days ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
176
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
153
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
134
click to vote
APN
1999
Springer
15 years 10 months ago
1999
Springer
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...