1883 search results - page 82 / 377 » Ordered theta graphs |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
ALGORITHMICA
2008
13 years 8 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
CCE
2006
13 years 7 months ago
2006
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
DAM
2000
13 years 7 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
TCS
2008
13 years 7 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...