1883 search results - page 83 / 377 » Ordered theta graphs |
LION
2009
Springer
14 years 2 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
DLT
2004
13 years 9 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
EMNLP
2006
13 years 9 months ago
2006
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
APPML
2008
13 years 8 months ago
2008
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
COMBINATORICS
2004
13 years 7 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...