214 search results - page 35 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
106
click to vote
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
WADS
1993
Springer
15 years 2 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
CP
2008
Springer
14 years 12 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
100
click to vote
BIRTHDAY
2008
Springer
15 years 3 days ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...