144 search results - page 16 / 29 » Path extendability of claw-free graphs |
125
click to vote
DCG
2010
14 years 9 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
WG
2010
Springer
14 years 8 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
MFCS
1998
Springer
15 years 1 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
CONSTRAINTS
2008
14 years 9 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...