278 search results - page 34 / 56 » Two Upper Bounds on the Chromatic Number |
GIS
2006
ACM
14 years 9 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more t...
IPCCC
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper focuses on network coding based multirate multimedia streaming in directed networks and aims at maximizing the total layers received by all receivers, which directly de...
ISPAN
2005
IEEE
14 years 2 months ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
COCOON
1999
Springer
14 years 23 days ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...