92 search results - page 10 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
LICS
2007
IEEE
14 years 5 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
ICDE
2004
IEEE
15 years 8 days ago
2004
IEEE
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
IWQOS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
ESA
1998
Springer
14 years 3 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
DAM
2010
13 years 11 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...