Results 1  10
of
221
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 496 (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
The Compactness of Interval Routing for Almost All Graphs
, 2001
"... Interval routing is a compact way for representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show th ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Interval routing is a compact way for representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show
Randomized directed neighborhoods with edge migration in particle swarm optimization
 in Proc. 2004 congress on evolutionary computation (CEC 2004
"... Abstract A key feature of Particle Swarm Optimization algorithms is that fitness information is shared with individuals in a particle’s neighborhood. The kind of neighborhood structure that is used affects the rate at which information is disseminated throughout the population. Existing work has st ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
studied global and simple local topologies, as well as more complex, but fixed neighborhood structures. This paper looks at randomly generated, directed graph structures in which information flows in one direction only, and also outgoing edges randomly migrate from one source node to another. Experimental
Graph Based SemiSupervised Learning with Sharper Edges
"... Abstract. In many graphbased semisupervised learning algorithms, edge weights are assumed to be fixed and determined by the data points’ (often symmetric) relationships in input space, without considering directionality. However, relationships may be more informative in one direction (e.g. from la ..."
Abstract
 Add to MetaCart
labelled to unlabelled) than in the reverse direction, and some relationships (e.g. strong weights between oppositely labelled points) are unhelpful in either direction. Undesirable edges may reduce the amount of influence an informative point can propagate to its neighbours – the point and its outgoing
ROCKPAPERSCISSORS MEETS BORROMEAN RINGS
"... Directed graphs with an odd number of vertices n, where each vertex has both (n − 1)/2 incoming and outgoing edges, have a rich structure. We were lead to their study by both the Borromean rings and the game rockpaperscissors. An interesting interplay between groups, graphs, topological ..."
Abstract
 Add to MetaCart
Directed graphs with an odd number of vertices n, where each vertex has both (n − 1)/2 incoming and outgoing edges, have a rich structure. We were lead to their study by both the Borromean rings and the game rockpaperscissors. An interesting interplay between groups, graphs, topological
P A SPREADING RATE OF VIRUS BETWEEN INCOMING AND OUTGOING LINKS OF A WEBSITE THROUGH AN INTUITIONISTIC FUZZY GRAPH
, 2016
"... Abstract: In this paper we analyzed the spreading rate of virus between incoming and outgoing links to a website. We have taken the website http://www.pantechsolutions.net/. This website is modeled as an intuitionistic fuzzy graph G = (V, E, µ, γ) by considering the navigation of the customers. In ..."
Abstract
 Add to MetaCart
Abstract: In this paper we analyzed the spreading rate of virus between incoming and outgoing links to a website. We have taken the website http://www.pantechsolutions.net/. This website is modeled as an intuitionistic fuzzy graph G = (V, E, µ, γ) by considering the navigation of the customers
Evaluating partially drawn links for directed graph edges
 In Proceedings of the International Conference on Graph Drawing
, 2012
"... Abstract. We investigate the readability of nodelink diagrams for directed graphs when using partially drawn links instead of showing each link explicitly in its full length. Providing the complete link information between related nodes in a graph can lead to visual clutter caused by many edge cro ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
and completion time for three different tasks: identifying the existence of a direct link, the existence of an indirect connection with one intermediate node, and the node with the largest number of outgoing edges. Furthermore, we compared tapered and traditional edge representations, three different graph
Completeness Results for Generalized Communicationfree Petri Nets with Arbitrary Edge Multiplicities
, 2013
"... We investigate gcfPetri nets, a generalization of communicationfree Petri nets allowing arbitrary edge multiplicities, and characterized by the sole restriction that each transition has at most one incoming edge. We use canonical firing sequences with nice properties for gcfPNs to show that the R ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
that the RecLFS, (zero)reachability, covering, and boundedness problems of gcfPNs are in PSPACE. By showing, how PSPACETuring machines can be simulated by gssPNs, a subclass of gcfPNs where additionally all transitions have at most one outgoing edge, we ultimately prove the PSPACE
Ordered Interval Routing Schemes
, 2004
"... An Interval Routing Scheme (IRS) represents the routing tables in a network in a spaceefficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is cal ..."
Abstract
 Add to MetaCart
An Interval Routing Scheme (IRS) represents the routing tables in a network in a spaceefficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label
Traversing Directed Eulerian Mazes
, 2002
"... The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finitestate automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are cal ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finitestate automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list
Results 1  10
of
221