3008 search results - page 55 / 602 » Independence in connected graphs |
91
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
107
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
51
Voted
DM
2007
15 years 22 days ago
2007
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
119
Voted
WG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
113
Voted
JDA
2006
15 years 22 days ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...