Sciweavers

97 search results - page 1 / 20
» Separating systems and oriented graphs of diameter two
Sort
View
JCT
2007
85views more  JCT 2007»
13 years 5 months ago
Separating systems and oriented graphs of diameter two
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
Béla Bollobás, Alex D. Scott
DM
2010
132views more  DM 2010»
13 years 5 months ago
Diameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
Martin Knor, Sanming Zhou
STOC
1990
ACM
95views Algorithms» more  STOC 1990»
13 years 9 months ago
Separators in Two and Three Dimensions
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
Gary L. Miller, William P. Thurston
SOFSEM
1997
Springer
13 years 9 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
TAOSD
2010
13 years 3 months ago
A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christo...