1395 search results - page 119 / 279 » (k, )-Distance-Hereditary Graphs |
FAW
2008
Springer
14 years 11 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
IPL
2006
14 years 10 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
DAM
2000
14 years 9 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
CHI
2006
ACM
15 years 10 months ago
2006
ACM
This paper illustrates work undertaken on the MultiVis project to allow visually impaired users both to construct and browse mathematical graphs effectively. We start by discussin...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...