5889 search results - page 160 / 1178 » Graph Layout Problems |
135
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
112
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
The Problem Frames approach captures problems as seen by developers, but not by stakeholders. This paper presents a framework that extends the problem diagram of the Problem Frame...
113
click to vote
FPL
2003
Springer
15 years 10 months ago
2003
Springer
With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this in...
133
click to vote
ALENEX
2001
15 years 6 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
118
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...