Sciweavers

1321 search results - page 59 / 265
» Quadratic forms on graphs
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 5 months ago
Harmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
Kyriaki Ioannidou, Stavros D. Nikolopoulos
SAC
2005
ACM
14 years 3 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
OOPSLA
1999
Springer
14 years 2 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
INFOCOM
2003
IEEE
14 years 3 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
GBRPR
2009
Springer
14 years 4 months ago
Matching Hierarchies of Deformable Shapes
This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their im...
Nadia Payet, Sinisa Todorovic