5100 search results - page 345 / 1020 » The Linear Complexity of a Graph |
120
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
132
click to vote
GMP
2006
IEEE
15 years 11 months ago
2006
IEEE
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
153
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
155
click to vote
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
155
click to vote
CCCG
2010
15 years 6 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...