Sciweavers

AAAI
2012
12 years 2 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
DM
2007
135views more  DM 2007»
14 years 3 days ago
Heavy fans, cycles and paths in weighted graphs of large connectivity
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
Jun Fujisawa
DM
2008
68views more  DM 2008»
14 years 6 days ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
CORR
2010
Springer
176views Education» more  CORR 2010»
14 years 7 days ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
14 years 4 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
AICCSA
2005
IEEE
103views Hardware» more  AICCSA 2005»
14 years 5 months ago
Consistent graph layout for weighted graphs
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
Dana Vrajitoru, Jason DeBoni
PODC
2006
ACM
14 years 6 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SCALESPACE
2007
Springer
14 years 6 months ago
Discrete Regularization on Weighted Graphs for Image and Mesh Filtering
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
Sébastien Bougleux, Abderrahim Elmoataz, Ma...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 6 months ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos
SCALESPACE
2009
Springer
14 years 6 months ago
Adaptation of Eikonal Equation over Weighted Graph
Abstract. In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a fa...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...