Sciweavers

5889 search results - page 128 / 1178

» Graph Layout Problems

98

Voted

INFORMS
2002

46views more INFORMS 2002»

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

15 years 4 months ago

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

Download www.ic.uff.br

Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F....

claim paper

Read More »

99

Voted

NETWORKS
1998

59views Computer Networks» more NETWORKS 1998»

Solving Steiner tree problems in graphs to optimality

15 years 4 months ago

Solving Steiner tree problems in graphs to optimality

Download www.iasi.cnr.it

Thorsten Koch, Alexander Martin

claim paper

Read More »

98

NETWORKS
1998

68views Computer Networks» more NETWORKS 1998»

A branch and cut algorithm for the Steiner problem in graphs

15 years 4 months ago

A branch and cut algorithm for the Steiner problem in graphs

Download cgm.cs.mcgill.ca

Abilio Lucena, J. E. Beasley

claim paper

Read More »

105

Voted

MP
2007

73views more MP 2007»

Semidefinite programming relaxations for graph coloring and maximal clique problems

15 years 4 months ago

Semidefinite programming relaxations for graph coloring and maximal clique problems

Download www.core.ucl.ac.be

Igor Dukanovic, Franz Rendl

claim paper

Read More »

142

IPL
2010

71views more IPL 2010»

New common ancestor problems in trees and directed acyclic graphs

15 years 3 months ago

New common ancestor problems in trees and directed acyclic graphs

Download www-ab.informatik.uni-tuebingen.de

We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...

Johannes Fischer, Daniel H. Huson

claim paper

Read More »

« Prev « First page 128 / 1178 Last » Next »