1395 search results - page 21 / 279 » (k, )-Distance-Hereditary Graphs |
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
SIAMDM
2010
13 years 3 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
JGT
2011
13 years 3 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
FOCS
1996
IEEE
14 years 19 days ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
ECEASST
2010
13 years 5 months ago
2010
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...