5889 search results - page 84 / 1178 » Graph Layout Problems |
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
AUSAI
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
COMBINATORICS
2004
13 years 10 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
AGTIVE
2007
Springer
14 years 4 months ago
2007
Springer
We present Tiger, a visual environment to design visual language (VL) specifications based on meta models, graph grammars and layout definitions. A VL specification serves as ba...