نتایج جستجو برای: edge connectivity

تعداد نتایج: 175083  

2003
Hiroyoshi Miwa Hiro Ito

The network reliability in multi-server environment is measured by the connectivity between a vertex and a vertex subset (NA-connectivity). The problem of augmenting a graph by adding the smallest number of new edges to meet NA-edge(vertex)-connectivity requirement is an important optimization problem that contributes to the network design problem to increase the reliability of a current networ...

2017
Bumhee Park Jinseok Eo Hae-Jeong Park

The idea that structural white matter connectivity constrains functional connectivity (interactions among brain regions) has widely been explored in studies of brain networks; studies have mostly focused on the "average" strength of functional connectivity. The question of how structural connectivity constrains the "variability" of functional connectivity remains unresolved. In this study, we i...

2015
Luis M. Colon-Perez Caitlin Spindler Shelby Goicochea William Triplett Mansi Parekh Eric Montie Paul R. Carney Catherine Price Thomas H. Mareci Heye Zhang

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is i...

Journal: :SIAM J. Comput. 1998
David Eppstein Zvi Galil Giuseppe F. Italiano Thomas H. Spencer

We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe algorithms and data structures for maintaining information about 2and 3-vertex-connectivity, and 3and 4-edge-connectivity in a planar graph in O(n1/2) amortized time per insertion, deletion, or connectivity query. All ...

Journal: :European Journal of Combinatorics 2011

Journal: :Theoretical Computer Science 2022

As a generalization of the traditional connectivity, g -component edge connectivity c ? ( G ) non-complete graph is minimum number edges to be deleted from such that resulting has at least components. Hypercube-like networks (HL-networks for short) are obtained by manipulating some pairs in hypercubes, which contain several famous interconnection as twisted cubes, Möbius crossed locally cubes. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید