Sciweavers

441 search results - page 35 / 89
» Convex Graph Invariants
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
EJC
2008
13 years 7 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
NETWORKS
2008
13 years 7 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
13 years 11 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
BIOCOMP
2008
13 years 9 months ago
GIPSCo: A Method for Comparison of Protein Structures Based on Geometric Invariants
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...
Sandeep Deshmukh, Aniket Dalal, Pramod Wangikar