1188 search results - page 38 / 238 » Extended Graph Unification |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
WG
2001
Springer
14 years 2 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
OptimixJ is a graph rewrite tool that generates Java code from rewrite specifications. Java classes are treated as graph schemas, enabling OptimixJ to extend legacy Java applicati...