1632 search results - page 31 / 327 » On special numberings of hypergraphs |
186
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
176
click to vote
JCO
2007
15 years 6 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
146
click to vote
JCT
2007
15 years 6 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
182
click to vote
VLSID
2000
IEEE
15 years 10 months ago
2000
IEEE
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...
179
click to vote
WSC
1998
15 years 7 months ago
1998
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...