Sciweavers

3204 search results - page 82 / 641
» The b-chromatic Number of a Graph
Sort
View
CGF
2004
92views more  CGF 2004»
13 years 10 months ago
Para-Graph: Graph-Based Parameterization of Triangle Meshes with Arbitrary Genus
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...
Giuseppe Patanè, Michela Spagnuolo, Bianca ...
CAI
2007
Springer
14 years 4 months ago
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
CAAN
2004
Springer
14 years 3 months ago
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
Anthony Bonato, Jeannette C. M. Janssen
PODS
1993
ACM
161views Database» more  PODS 1993»
14 years 2 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 1 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen