1883 search results - page 96 / 377 » Ordered theta graphs |
GPCE
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
APPROX
2007
Springer
13 years 12 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
EJC
2010
13 years 8 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...