1493 search results - page 71 / 299 » Local resilience of graphs |
93
Voted
DAM
2008
15 years 21 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
110
click to vote
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
115
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Appearance-based localization compares the current image taken from a robot's camera to a set of pre-recorded images in order to estimate the current location of the robot. S...
76
Voted
ICRA
2009
IEEE
15 years 7 months ago
2009
IEEE
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
108
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...