Sciweavers

288 search results - page 38 / 58
» Linearly bounded infinite graphs
Sort
View
CPC
2007
112views more  CPC 2007»
13 years 7 months ago
Graphs with Large Girth Not Embeddable in the Sphere
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
Pierre Charbit, Stéphan Thomassé
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
SIROCCO
2007
13 years 9 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
WG
1995
Springer
13 years 11 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 7 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo