Sciweavers

1883 search results - page 172 / 377
» Ordered theta graphs
Sort
View
IM
2007
13 years 8 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
ANOR
2004
170views more  ANOR 2004»
13 years 8 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
ICITS
2011
12 years 11 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 9 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ICALP
2009
Springer
14 years 8 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula