Sciweavers

491 search results - page 38 / 99
» On cyclically orientable graphs
Sort
View
SOFSEM
1997
Springer
14 years 19 days ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
WECWIS
2006
IEEE
144views ECommerce» more  WECWIS 2006»
14 years 2 months ago
Evaluation of Adaptive Computing Concepts for Classical ERP Systems and Enterprise Services
— To ensure the operability and reliability of large scale Enterprise Resource Planning Systems (ERP), a peak-load oriented hardware sizing is often used. Better utilization can ...
Martin Wimmer, Valentin Nicolescu, Daniel Gmach, M...
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 8 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
GD
2009
Springer
14 years 1 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
VLDB
1994
ACM
115views Database» more  VLDB 1994»
14 years 16 days ago
Database Graph Views: A Practical Model to Manage Persistent Graphs
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
Alejandro Gutiérrez, Philippe Pucheral, Her...