Sciweavers

1883 search results - page 90 / 377
» Ordered theta graphs
Sort
View
WCET
2007
13 years 9 months ago
Analysis of path exclusion at the machine code level
We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
Ingmar Stein, Florian Martin
JCT
2008
85views more  JCT 2008»
13 years 7 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
COMBINATORICS
2004
81views more  COMBINATORICS 2004»
13 years 7 months ago
Propagation of Mean Degrees
We propose two alternative measures of the local irregularity of a graph in terms of its vertex degrees and relate these measures to the order and the global irregularity of the g...
Dieter Rautenbach
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 7 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
CORR
2011
Springer
256views Education» more  CORR 2011»
13 years 2 months ago
Approximating Graphic TSP by Matchings
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
Tobias Mömke, Ola Svensson