3204 search results - page 152 / 641 » The b-chromatic Number of a Graph |
EVOW
2006
Springer
14 years 1 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
AAIM
2010
Springer
14 years 1 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
ACL
2006
13 years 11 months ago
2006
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
CIC
2004
13 years 11 months ago
2004
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
SLP
1997
13 years 11 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...