Sciweavers

6598 search results - page 14 / 1320
» Graph Theory with Applications
Sort
View
FCT
2003
Springer
15 years 4 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 11 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
AML
1999
135views more  AML 1999»
14 years 11 months ago
Random graphs in the monadic theory of order
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
Shmuel Lifsches, Saharon Shelah
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
14 years 11 months ago
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
Francesco M. Malvestuto, Mauro Mezzini
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 11 months ago
On affine rigidity
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
Steven J. Gortler, Craig Gotsman, Ligang Liu, Dyla...