3471 search results - page 175 / 695 » Obstacle Numbers of Graphs |
153
click to vote
AE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
166
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
134
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
138
Voted
CMSB
2006
Springer
15 years 8 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
153
Voted
CATS
2006
15 years 6 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...