46 search results - page 3 / 10 » Partial Characterizations of Circular-Arc Graphs |
108
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
112
click to vote
ICCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
ASP
2003
Springer
15 years 5 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
EJC
2006
14 years 11 months ago
2006
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
105
click to vote
GD
2003
Springer
15 years 5 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...