5889 search results - page 181 / 1178 » Graph Layout Problems |
166
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
159
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
147
click to vote
CSCLP
2005
Springer
15 years 12 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
158
click to vote
DAM
2006
15 years 6 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
138
click to vote
FMSD
2007
15 years 6 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...