Sciweavers

1605 search results - page 47 / 321
» On Partitional Labelings of Graphs
Sort
View
IPPS
2000
IEEE
14 years 1 months ago
A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
Suely Oliveira, Takako Soma
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 8 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
CCCG
2007
13 years 10 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
ICPR
2008
IEEE
14 years 3 months ago
A new clustering approach based on graph partitioning for navigation patterns mining
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
Mehrdad Jalali, Norwati Mustapha, Ali Mamat, Nasir...