650 search results - page 90 / 130 » Positive graphs |
SIAMDM
2002
13 years 9 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
JCT
2010
13 years 8 months ago
2010
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
TSMC
2010
13 years 4 months ago
2010
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
CVPR
2007
IEEE
14 years 12 months ago
2007
IEEE
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...