708 search results - page 4 / 142 » A study of graph spectra for comparing graphs and trees |
DAM
2011
13 years 3 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
IPCO
2008
13 years 10 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
AGTIVE
2007
Springer
14 years 16 days ago
2007
Springer
Abstract. Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. However, many other competing approaches...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
IFL
1997
Springer
14 years 20 days ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...