Sciweavers

45 search results - page 3 / 9
» Vertex rankings of chordal graphs and weighted trees
Sort
View
WG
2010
Springer
13 years 4 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 6 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...
IPL
2007
114views more  IPL 2007»
13 years 6 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 1 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
13 years 10 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang