TY - JOUR

T1 - Testing Orientation Properties

AU - Halevy, Shirley

AU - Lachish, Oded

AU - Newman, Ilan

AU - Tsur, Dekel

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2005

Y1 - 2005

N2 - We propose a new model for studying graph related problems that we call the orientation model. In this model, an undirected graph G is fixed, and the input is any possible edge orientation of G. A property is now a property of the directed graph that is obtained by a given orientation. The distance between two orientations is the number of edges that have to be redirected in order to move from one digraph to the other. This model allows studying digraph properties such as not containing a forbidden (induced) subgraph, being strongly connected etc., for every underlying graph including sparse graphs. As it turns out, this model generalizes the standard, adjacency matrix model. That is, we show that for every graph property P of dense graphs there is a property of orientations that is testable if and only if P is. This model is also handy in some practical situations of networks, in which the underlying network is fixed while the direction of (weighted) links may vary. We show that several orientations properties are testable in this model (for every underlying graph), while some are not.

AB - We propose a new model for studying graph related problems that we call the orientation model. In this model, an undirected graph G is fixed, and the input is any possible edge orientation of G. A property is now a property of the directed graph that is obtained by a given orientation. The distance between two orientations is the number of edges that have to be redirected in order to move from one digraph to the other. This model allows studying digraph properties such as not containing a forbidden (induced) subgraph, being strongly connected etc., for every underlying graph including sparse graphs. As it turns out, this model generalizes the standard, adjacency matrix model. That is, we show that for every graph property P of dense graphs there is a property of orientations that is testable if and only if P is. This model is also handy in some practical situations of networks, in which the underlying network is fixed while the direction of (weighted) links may vary. We show that several orientations properties are testable in this model (for every underlying graph), while some are not.

M3 - מאמר

JO - Electronic Colloquium on Computational Complexity

JF - Electronic Colloquium on Computational Complexity

IS - 153

M1 - 153

ER -