1105 search results - page 54 / 221 » Linear choosability of graphs |
105
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
100
click to vote
DAM
2008
14 years 12 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
DAM
2007
14 years 12 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
SIBGRAPI
2006
IEEE
15 years 5 months ago
2006
IEEE
The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in...