The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...