2294 search results - page 310 / 459 » From Path Graphs to Directed Path Graphs |
105
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
112
click to vote
SENSYS
2004
ACM
15 years 8 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
107
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
103
click to vote
JSAI
2001
Springer
15 years 7 months ago
2001
Springer
The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents, such as papers. A...
112
Voted
ISAAC
1995
Springer
15 years 6 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...