Bill Bogstad - Academia.edu (original) (raw)
Address: Cambridge, Massachusetts, United States
less
Related Authors
Uploads
Papers by Bill Bogstad
Computer Networks, 1999
A key performance measure for the World Wide Web is the speed with which content is served to use... more A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance.
Discrete Mathematics, 2004
The distinguishing number of a graph G is the minimum number of colors for which there exists an ... more The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of G consists only of the identity. It is shown, for the d-dimensional hypercubic graphs H d , that D(H d ) = 3 if d ∈ {2; 3} and D(H d ) = 2 if d ¿ 4. It is also shown that D(H 2 d ) = 4 for d ∈ {2; 3} and D(H 2 d ) = 2 for d ¿ 4, where H 2 d denotes the square of the d-dimensional hypercube. This solves the distinguishing number for hypercubic graphs and their squares.
Discrete Mathematics, 2004
The distinguishing number of a graph G is the minimum number of colors for which there exists an ... more The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of G consists only of the identity. It is shown, for the d-dimensional hypercubic graphs H d , that D(H d ) = 3 if d ∈ {2; 3} and D(H d ) = 2 if d ¿ 4. It is also shown that D(H 2 d ) = 4 for d ∈ {2; 3} and D(H 2 d ) = 2 for d ¿ 4, where H 2 d denotes the square of the d-dimensional hypercube. This solves the distinguishing number for hypercubic graphs and their squares.
Computer Networks, 1999
A key performance measure for the World Wide Web is the speed with which content is served to use... more A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance.
Discrete Mathematics, 2004
The distinguishing number of a graph G is the minimum number of colors for which there exists an ... more The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of G consists only of the identity. It is shown, for the d-dimensional hypercubic graphs H d , that D(H d ) = 3 if d ∈ {2; 3} and D(H d ) = 2 if d ¿ 4. It is also shown that D(H 2 d ) = 4 for d ∈ {2; 3} and D(H 2 d ) = 2 for d ¿ 4, where H 2 d denotes the square of the d-dimensional hypercube. This solves the distinguishing number for hypercubic graphs and their squares.
Discrete Mathematics, 2004
The distinguishing number of a graph G is the minimum number of colors for which there exists an ... more The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of G consists only of the identity. It is shown, for the d-dimensional hypercubic graphs H d , that D(H d ) = 3 if d ∈ {2; 3} and D(H d ) = 2 if d ¿ 4. It is also shown that D(H 2 d ) = 4 for d ∈ {2; 3} and D(H 2 d ) = 2 for d ¿ 4, where H 2 d denotes the square of the d-dimensional hypercube. This solves the distinguishing number for hypercubic graphs and their squares.