Sciweavers

3008 search results - page 54 / 602
» Independence in connected graphs
Sort
View
87
Voted
ICALP
2007
Springer
15 years 7 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
114
Voted
COCOON
2006
Springer
15 years 2 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...
112
Voted
ACCV
2010
Springer
14 years 7 months ago
Network Connectivity via Inference over Curvature-Regularizing Line Graphs
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
Maxwell D. Collins, Vikas Singh, Andrew L. Alexand...
83
Voted
JCT
2008
70views more  JCT 2008»
15 years 22 days ago
Connectivity keeping edges in graphs with large minimum degree
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
Shinya Fujita, Ken-ichi Kawarabayashi