Results 1  10
of
213,911
Graph topologies on closed multifunctions
, 2003
"... In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X × Y using various hpertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X × Y. We also study several topologies ..."
Abstract
 Add to MetaCart
In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X × Y using various hpertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X × Y. We also study several
Network Robustness and Graph Topology
, 2004
"... Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to communications infrastructure. This combination of factors makes it important to study the robustness of network topologi ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
topologies. We use graphtheoretic concepts of connectivity to do this, and argue that node connectivity is the most useful such measure. We examine the relationship between node connectivity and network symmetry, and describe two conditions which robust networks should satisfy. To assist with the process
THE CARRIER GRAPH TOPOLOGY
"... Abstract. We define a new metric on the set of all closed linear operators between Hilbert spaces and investigate its properties. In particular, we show that the set of all closed operators with a closed range is an open subset of the set of all closed operators and the map T 7 → T † is an isometry ..."
Abstract
 Add to MetaCart
in this metric. We also investigate the relationships between the topology induced by this metric and the gap metric. 1.
GRAPHS, TOPOLOGIES AND SIMPLE GAMES
, 2000
"... We study the existence of connected coalitions in a simple game restricted by a partial order. First, we define a topology compatible with the partial order in the set of players. Second, we prove some properties of the covering and comparability graphs of a finite poset. Finally, we analize the cor ..."
Abstract
 Add to MetaCart
We study the existence of connected coalitions in a simple game restricted by a partial order. First, we define a topology compatible with the partial order in the set of players. Second, we prove some properties of the covering and comparability graphs of a finite poset. Finally, we analize
Exploiting Graph Topology For Optimization Problems
, 1996
"... . Constraint 1 satisfaction problems can be modeled as graphs with the decision points represented as vertices and constraints drawn as edges. Graphs can be onedimensional (trees), twodimensional (planes), threedimensional (cubes), etc., up to Ndimensional (cliques), or combinations of any of ..."
Abstract
 Add to MetaCart
can have their complexity significantly reduced. In this paper, we present the key concepts and algorithms behind this approach and apply the results to graph coloring and natural language semantic analysis. We also introduce a new measure of complexity, discuss its relationship to graph topology
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract

Cited by 492 (0 self)
 Add to MetaCart
model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertexcentric approach
Modeling Internet Topology
 IEEE COMMUNICATIONS MAGAZINE
, 1997
"... The topology of a network, or a group of networks such as the Internet, has a strong bearing on many management and performance issues. Good models of the topological structure of a network are essential for developing and analyzing internetworking technology. This article discusses how graphbased ..."
Abstract

Cited by 493 (21 self)
 Add to MetaCart
The topology of a network, or a group of networks such as the Internet, has a strong bearing on many management and performance issues. Good models of the topological structure of a network are essential for developing and analyzing internetworking technology. This article discusses how graph
Distinguishing Infections on Different Graph Topologies
, 2014
"... The history of infections and epidemics holds famous examples where understanding, containing and ultimately treating an outbreak began with understanding its mode of spread. Influenza, HIV and most computer viruses, spread person to person, device to device, through contact networks; Cholera, Canc ..."
Abstract
 Add to MetaCart
, highly scalable algorithms that solve these problems. We show that the identifiability condition we give is fairly mild, and in particular, is satisfied by two common graph topologies: the grid, and the ErdösRenyi graphs. 1
On PowerLaw Relationships of the Internet Topology
 IN SIGCOMM
, 1999
"... Despite the apparent randomness of the Internet, we discover some surprisingly simple powerlaws of the Internet topology. These powerlaws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our powerl ..."
Abstract

Cited by 1668 (71 self)
 Add to MetaCart
Despite the apparent randomness of the Internet, we discover some surprisingly simple powerlaws of the Internet topology. These powerlaws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our power
Results 1  10
of
213,911