3958 search results - page 100 / 792 » Dynamic Graph Algorithms with Applications |
233
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
187
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
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...
139
click to vote
SOFTVIS
2005
ACM
16 years 6 days ago
2005
ACM
In this paper we present an approach to modeling and visualizing the dynamic interactions among objects in a C++ application. We exploit UML diagrams to expressively visualize bot...
236
Voted
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
194
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...