Sciweavers

361 search results - page 7 / 73
» Relaxed Gabriel Graphs
Sort
View
WG
2004
Springer
14 years 24 days ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
COR
2008
92views more  COR 2008»
13 years 7 months ago
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
WG
2010
Springer
13 years 5 months ago
On the Boolean-Width of a Graph: Structure and Applications
Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich,...
DAM
1999
81views more  DAM 1999»
13 years 7 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano