3267 search results - page 156 / 654 » Generalized quasirandom graphs |
130
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
A general method of systematic derivation of affine moment invariants of any weights and orders is introduced. Each invariant is expressed by its generating graph. Techniques for ...
132
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
115
click to vote
CPC
2006
15 years 4 months ago
2006
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob
157
click to vote
JCT
2008
15 years 4 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
128
click to vote
ORDER
2008
15 years 4 months ago
2008
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...