منابع مشابه
An Algorithm for Packing Connectors
Given an undirected graph G = (V; E) and a partition fS; Tg of V , an S{T connector is a set of edges F E such that every component of the subgraph (V; F) intersects both S and T. If either S or T is a singleton, then an S{T connector is a spanning tree of G. On the other hand, if G is bipartite with colour classes S and T, then an S{T connector is an edge cover of G (a set of edges covering al...
متن کاملPacking of Steiner trees and S-connectors in graphs
Nash-Williams and Tutte independently characterized when a graph has k edgedisjoint spanning trees; a consequence is that 2k-edge-connected graphs have k edgedisjoint spanning trees. Kriesell conjectured a more general statement: defining a set S ⊆ V (G) to be j-edge-connected in G if S lies in a single component of any graph obtained by deleting fewer than j edges from G, he conjectured that i...
متن کاملNew Insights on Architectural Connectors
This work is a first step toward the reconciliation of the two main approaches to composition in system modeling, namely the categorical one and the algebraic one. In particular, we present a mapping from CommUnity, which uses the categorical approach based on colimits, into the Tile Model, which uses algebraic operators for composition. Our results include a standard decomposition for CommUnit...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملGeneralized Connectors
An n-connector is an acyclic directed graph having n inputs and n outputs and satisfying the following condition: given any one-to-one correspondence between inputs and distinct outputs, there exists a set of vertex-disjoint paths that join each input to the corresponding output. It is known that the minimum possible number of edges in an n-connector lies between lower and upper bounds that are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1998
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1825