Sciweavers

3211 search results - page 108 / 643
» On the Grundy Number of a Graph
Sort
View
ICDCIT
2005
Springer
14 years 3 months ago
Cleaning an Arbitrary Regular Network with Mobile Agents
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
Paola Flocchini, Amiya Nayak, Arno Schulz
COCOON
2009
Springer
14 years 4 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern
WPES
2006
ACM
14 years 4 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
EMMCVPR
2001
Springer
14 years 2 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
13 years 10 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...