3204 search results - page 44 / 641 » The b-chromatic Number of a Graph |
ICCTA
2007
IEEE
14 years 1 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
TAGT
1994
Springer
14 years 2 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
FLAIRS
2007
14 years 8 days ago
2007
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
INFORMATICALT
2007
13 years 10 months ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...