Sciweavers

1605 search results - page 141 / 321
» On Partitional Labelings of Graphs
Sort
View
ICALP
2009
Springer
16 years 28 days ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
110
Voted
PCM
2004
Springer
103views Multimedia» more  PCM 2004»
15 years 6 months ago
Spectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...
Sung-Yeol Kim, Seung-Uk Yoon, Yo-Sung Ho
119
Voted
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 1 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
123
Voted
ICCS
2005
Springer
15 years 6 months ago
Analyzing Conflicts with Concept-Based Learning
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
Boris Galitsky, Sergei O. Kuznetsov, Mikhail V. Sa...
85
Voted
IPL
2000
105views more  IPL 2000»
15 years 13 days ago
Coverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
Paolo Boldi, Sebastiano Vigna