4541 search results - page 238 / 909 » Cache-Oblivious Algorithms and Data Structures |
123
click to vote
ISAAC
1995
Springer
15 years 7 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...
157
Voted
TON
2010
14 years 10 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
124
click to vote
SEKE
2007
Springer
15 years 9 months ago
2007
Springer
XML diff algorithms proposed in the literature have focused on the structural analysis of the document. When XML is used for data exchange, or when different versions of a documen...
122
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
120
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network ca...