990 search results - page 59 / 198 » Sub-Graphs of Complete Graph |
GG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
ICOIN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
CIAC
2010
Springer
14 years 16 days ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
CPC
2006
13 years 9 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...