8825 search results - page 95 / 1765 » All for one or one for all |
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
JASIS
2002
15 years 28 days ago
2002
We consider the recently proposed XQL language, which is designed to query XML documents by content and structure. We show that an already existing model, namely \Proximal Nodes&q...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
127
click to vote
JCT
2008
14 years 11 months ago
2008
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
115
click to vote
IPL
2010
14 years 11 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...