754 search results - page 39 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
PODC
2010
ACM
14 years 11 days ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
ALGORITHMICA
2006
13 years 8 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
CCCG
2007
13 years 10 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
FAW
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...