1002 search results - page 12 / 201 » Towards Graph Programs for Graph Algorithms |
89
Voted
AGTIVE
1999
Springer
15 years 1 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
COCOON
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
110
click to vote
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
76
Voted
MST
2008
14 years 9 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...