2503 search results - page 31 / 501 » A study of 3-arc graphs |
GD
2005
Springer
14 years 3 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
IPL
2000
13 years 9 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
ICFP
2012
ACM
12 years 2 days ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
FUIN
2010
13 years 7 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr