3471 search results - page 226 / 695 » Obstacle Numbers of Graphs |
139
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
143
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
160
click to vote
COR
2011
15 years 2 days ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
123
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
140
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...