Sciweavers

3396 search results - page 79 / 680
» Tree representations of graphs
Sort
View
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
14 years 29 days ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
IPL
2007
114views more  IPL 2007»
13 years 8 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...
ADAEUROPE
2004
Springer
14 years 2 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
ISAAC
2007
Springer
98views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Width-Optimal Visibility Representations of Plane Graphs
Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun ...