51 search results - page 8 / 11 » Dependent Rounding in Bipartite Graphs |
TCC
2009
Springer
14 years 9 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
COMSWARE
2007
IEEE
14 years 3 months ago
2007
IEEE
— VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-s...
CIE
2011
Springer
12 years 8 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
CATS
2008
13 years 10 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...