1105 search results - page 31 / 221 » Linear choosability of graphs |
100
click to vote
ALGORITHMICA
2011
14 years 4 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...
116
click to vote
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
117
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
BCB
2010
2010
Fast graph approaches to measure influenza transmission across geographically distributed host types
14 years 4 months ago
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...