3105 search results - page 524 / 621 » The Path-Packing Structure of Graphs |
139
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
132
click to vote
PAISI
2009
Springer
15 years 9 months ago
2009
Springer
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
130
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
117
click to vote
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
139
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...