4865 search results - page 167 / 973 » The Complexity of Graph Connectivity |
114
Voted
CCCG
2004
15 years 4 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
127
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
152
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
125
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
133
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...