1986 search results - page 138 / 398 » Path Separability of Graphs |
ORL
2008
13 years 10 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
CCR
1998
13 years 9 months ago
1998
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
SPLC
2010
13 years 8 months ago
2010
Abstract. Software Product Line (SPL) engineering offers several advantages in the development of families of software products. There is still a need, however, for better underst...
IPL
2008
13 years 10 months ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
GD
2009
Springer
14 years 2 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...