101 search results - page 5 / 21 » To Be and Not To Be: 3-Valued Relations on Graphs |
109
click to vote
BNCOD
2004
15 years 3 months ago
2004
This technical report describes the XML data integration framework being built within the AutoMed heterogeneous data integration system. It presents a description of the overall f...
JGT
2007
15 years 1 months ago
2007
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
107
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
148
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
103
click to vote
DM
2006
15 years 1 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...