136 search results - page 20 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present a number of improvements that were recently made to the template based speech recognition system developed at ESAT. Combining these improvements resulted ...
GD
2009
Springer
14 years 6 days ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...