Results 11 to 20 of about 2,283,531 (215)

Graph and network algorithms [PDF]

open access: yesACM Computing Surveys, 1996
Graphs provide a powerful tool to model objects and relationships among objects. The study of graphs dates back to Euler’s days in the 18th century, when he defined the Konigsberg bridge problem, and since then has been pursued by many researchers.
Samir Khuller, Balaji Raghavachari
openaire   +1 more source

A Heuristic for Direct Product Graph Decomposition [PDF]

open access: yes, 2023
In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph G with adjacency matrix Adj(G), our heuristic
Moreno Marzolla   +2 more
core   +1 more source

Exploring Graph Traversal Algorithms in Graph-Based Molecular Generation [PDF]

open access: yes, 2021
Here, we explore the impact of different graph traversal algorithms on molecular graph generation. We do this by training a graph-based deep molecular generative model to build structures using a node order determined via either a breadth- or depth-first
Engkvist, Ola   +11 more
core   +1 more source

Graph Algorithm Animation with Grrr [PDF]

open access: yes, 2000
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers   +3 more
core   +1 more source

Algorithms on evolving graphs [PDF]

open access: yesProceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012
Motivated by applications that concern graphs that are evolving and massive in nature, we define a new general framework for computing with such graphs. In our framework, the graph changes over time and an algorithm can only track these changes by explicitly probing the graph.
Aris Anagnostopoulos   +4 more
openaire   +4 more sources

A survey of graph-based algorithms for discovering business processes

open access: yesIJAIN (International Journal of Advances in Intelligent Informatics), 2019
Algorithms of process discovery help analysts to understand business processes and problems in a system by creating a process model based on a log of the system. There are existing algorithms of process discovery, namely graph-based.
Riyanarto Sarno, Kelly Rossa Sungkono
doaj   +1 more source

Graph Extremities Defined by Search Algorithms

open access: yesAlgorithms, 2010
Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat   +3 more
doaj   +1 more source

Schematic Representation of Large Biconnected Graphs [PDF]

open access: yes, 2021
Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair.
Fabrizio Frati   +3 more
core   +1 more source

GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]

open access: yes, 2013
We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core   +1 more source

A survey of two-dimensional graph layout techniques for information visualisation [PDF]

open access: yes, 2012
Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core   +1 more source

Home - About - Disclaimer - Privacy