3204 search results - page 50 / 641 » The Alcuin Number of a Graph |
JUCS
2007
13 years 7 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
DM
2006
13 years 8 months ago
2006
Let 1 s1 < s2 <
IPL
2008
13 years 8 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
CPC
2007
13 years 8 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
FOCS
1989
IEEE
14 years 1 days ago
1989
IEEE