Sciweavers

1493 search results - page 20 / 299
» Local resilience of graphs
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
Internet Cache Pollution Attacks and Countermeasures
Abstract— Proxy caching servers are widely deployed in today’s Internet. While cooperation among proxy caches can significantly improve a network’s resilience to denial-of-s...
Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, Yan C...
IV
2003
IEEE
85views Visualization» more  IV 2003»
14 years 28 days ago
Movement as an Aid to Understanding Graphs
This paper describes a graph visualization method that attempts to aid the understanding of graphs by adding continuous local movement to graph diagrams. The paper includes a disc...
John Bovey, Peter Rodgers, Florence Benoy
AMC
2008
78views more  AMC 2008»
13 years 7 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
DM
2008
86views more  DM 2008»
13 years 7 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 6 months ago
Locally identifying coloring of graphs
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
Louis Esperet, Sylvain Gravier, Mickaël Monta...