1633 search results - page 131 / 327 » Planar Map Graphs |
141
Voted
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
167
click to vote
ICALP
1995
Springer
15 years 4 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...
106
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
105
click to vote
TMRA
2005
Springer
15 years 6 months ago
2005
Springer
This work-in-progress report subsumes our ongoing research to develop a Topic Maps centric, modularised system which supports collaborative software development by combining the me...
81
Voted
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...