966 search results - page 39 / 194 » Small Alliances in Graphs |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
FCCM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
CSE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
RANDOM
2001
Springer
14 years 1 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...