2283 search results - page 155 / 457 » Bounds of Graph Characteristics |
146
click to vote
SIAMDM
2010
14 years 10 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
145
Voted
IANDC
2008
15 years 3 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
126
Voted
ICCS
1997
Springer
15 years 7 months ago
1997
Springer
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
149
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
164
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...