3008 search results - page 71 / 602 » Independence in connected graphs |
100
click to vote
ALGORITHMICA
2010
15 years 28 days ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
110
click to vote
SIAMDM
2000
15 years 17 days ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
76
Voted
DM
2010
15 years 27 days ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
97
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
The widespread availability of digital cameras and ubiquitous Internet access have facilitated the creation of massive image collections. These collections can be highly interconn...
104
Voted
SIROCCO
2008
15 years 2 months ago
2008
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...