491 search results - page 39 / 99 » On cyclically orientable graphs |
116
click to vote
ALGORITHMICA
2011
14 years 7 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...
JCT
2007
14 years 11 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
114
click to vote
DAC
2007
ACM
16 years 27 days ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
129
click to vote
VISSOFT
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper a new approach for a metrics based software visualization is presented which supports an efficient and effective quality assessment of large object-oriented software...
119
click to vote
GD
2003
Springer
15 years 5 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...