2150 search results - page 133 / 430 » On a restricted cross-intersection problem |
119
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...
171
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
190
click to vote
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...
144
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
197
click to vote
CSCLP
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...