1274 search results - page 57 / 255 » Graph lambda theories |
GECCO
2006
Springer
14 years 16 days ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
SIAMCOMP
2002
13 years 8 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
HICSS
2003
IEEE
14 years 2 months ago
2003
IEEE
Managers and group leaders of a community may not have enough information to help them direct the community development. In this paper, we adopt social network analysis, graph the...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...