Sciweavers

3267 search results - page 163 / 654
» Generalized quasirandom graphs
Sort
View
PODC
2010
ACM
15 years 6 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
ICCS
2007
Springer
15 years 6 months ago
Conceptual Graphs as Cooperative Formalism to Build and Validate a Domain Expertise
Abstract. This work takes place in the general context of the construction and validation of a domain expertise. It aims at the cooperation of two kinds of knowledge, heterogeneous...
Rallou Thomopoulos, Jean-François Baget, Ol...
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
15 years 6 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
DM
2008
68views more  DM 2008»
15 years 4 months 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
ECCC
2008
65views more  ECCC 2008»
15 years 4 months ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro