1963 search results - page 213 / 393 » The Maximum Solution Problem on Graphs |
127
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
86
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
115
click to vote
ICTAI
2010
IEEE
14 years 10 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
82
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
111
Voted
ALGORITHMICA
1998
15 years 16 days ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...