Structural Cohesion and Embeddedness: A hierarchical conception of social groups. White - American Sociological Review , " While questions about social cohesion lie at the core of our discipline, definitions are often vague and difficult to operationalize. We link research on social cohesion and social embeddedness by developing a conception of structural cohesion based on network nodeconnectivity. Structural cohesion i Structural cohesion is defined as the minimum number of actors who, if removed from a group, would disconnect the group.

Author: | Maladal Gojin |

Country: | Ethiopia |

Language: | English (Spanish) |

Genre: | Politics |

Published (Last): | 6 September 2007 |

Pages: | 249 |

PDF File Size: | 6.98 Mb |

ePub File Size: | 19.51 Mb |

ISBN: | 179-8-40687-796-6 |

Downloads: | 81386 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Molrajas |

Minor Containing a Fixed Edge. International Journal of Combinatorics , Crossref Generalized flowers in k-connected graphs. Journal of Mathematical Sciences , Crossref The structure of a decomposition of a triconnected graph. Crossref Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theoretical Computer Science , Crossref On graphs with no induced subdivision of K4. Journal of Combinatorial Theory, Series B , Crossref Almost Exact Matchings.

Algorithmica , Discrete Applied Mathematics , Crossref Balanced group-labeled graphs. Discrete Mathematics , Crossref Rapid mesh network setup for indoor RF tracking. Crossref Construction Sequences and Certifying 3-connectivity. Graph Drawing, Crossref Fun with Algorithms, Certifying 3-Connectivity in Linear Time.

Automata, Languages, and Programming, Computing and Combinatorics, Crossref Subgraphs of 4-Regular Planar Graphs. Crossref Fast computation of small cuts via cycle space sampling. ACM Transactions on Algorithms , Theory of Computing Systems , Crossref Connectivity of workflow nets: the foundations of stepwise verification. Acta Informatica , Crossref Certifying algorithms. Computer Science Review , Flows in Networks.

Graphs: Theory and Algorithms, Theoretical Computer Science, Web Services and Formal Methods, Some Tractable Win-Lose Games. Theory and Applications of Models of Computation, Automata, Languages and Programming, Crossref Separator-based data reduction for signed graph balancing.

Journal of Combinatorial Optimization , Crossref A plane graph representation of triconnected graphs. Discrete Mathematics, Algorithms and Applications , Crossref Computing Tutte Polynomials. Crossref Rigidity, global rigidity, and graph decomposition. European Journal of Combinatorics , Crossref Finding large cycles in Hamiltonian graphs.

Crossref An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry , Crossref Shinya Fujita and Henry Liu. Journal of Graph Theory , Algorithm Engineering: Concepts and Practice.

Experimental Methods for the Analysis of Optimization Algorithms, Fete of Combinatorics and Computer Science, Progress on Certifying Algorithms. Frontiers in Algorithmics, Semantic Business Process Engineering. Reasoning Web. Semantic Technologies for Software Engineering, The Biconnected Verification of Workflow Nets. Algorithms and Computation, Crossref Globally rigid circuits of the direction—length rigidity matroid.

Crossref Rigid tensegrity labelings of graphs. Crossref The refined process structure tree. Crossref Parameterized graph cleaning problems. Crossref Structure and enumeration of two-connected graphs with prescribed three-connected components. Advances in Applied Mathematics , Crossref Minimum augmentation to tri-connect a bi-connected graph with upper bounds on vertex-degree.

Crossref Non-planar core reduction of graphs. Crossref Yet another optimal algorithm for 3-edge-connectivity.

Journal of Discrete Algorithms , On the Complexity of Matroid Isomorphism Problems. Computer Science - Theory and Applications, Fundamentals of Computation Theory, Algorithm Engineering — An Attempt at a Definition.

Efficient Algorithms, The Triconnected Abstraction of Process Models. Business Process Management, Crossref Generating 3-vertex connected spanning subgraphs. Crossref A branch-and-cut approach to the crossing number problem. Discrete Optimization , Crossref Graph connectivity, partial words, and a theorem of Fine and Wilf. Information and Computation , Crossref V. Arvind , Christine T. Cheng , and Nikhil R. The Refined Process Structure Tree. Finding Long Paths, Cycles and Circuits.

Parameterized Graph Cleaning Problems. Graph-Theoretic Concepts in Computer Science, Crossref The source location problem with local 3-vertex-connectivity requirements. Crossref Harold N. Almost Exact Matchings. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Crossref A Theory of Network Localization. International Journal of Foundations of Computer Science , Crossref Acyclically pushable bipartite permutation digraphs: An algorithm.

Information Processing Letters , Crossref The multiroute maximum flow problem revisited. Networks ,

ELKAY EZH20 PDF

## SIAM Journal on Computing

Related Products Ito have identified the following relevant lab reagents. CiteULike uses cookies, some of which may already have been set. Setup a permanent sync to delicious. SPQR tree — Wikipedia With the SPQR tree of a graph G without Q nodes it is straightforward to find every pair of vertices u and v in G such that removing u and v from G leaves a disconnected graph, and the connected components of the remaining graphs:. Find this article at Save current location: This page was last edited on 16 Mayat We will interpret your continued use of this site as your acceptance of our use of cookies. To insert individual citation into a bibliography in a word-processor, select your preferred citation style below and drag-and-drop it into the document.

POLIP ENDOMETRIUM PDF

## DIVIDING A GRAPH INTO TRICONNECTED COMPONENTS PDF

Our algorithm, like other Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new technique, local replacement, to improve the complexity. Only the need to use the subroutines for connected components and integer sorting, for which no optimal parallel algorithm that runs in O log n time is known, prevents our algorithm from achieving optimality. Designing efficient algorithms for determining the connectivity of graphs has been a subject of great interest in the last two decades.