Results 11 to 20 of about 206,716 (316)
A Heuristic for Direct Product Graph Decomposition [PDF]
, 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
Graph and network algorithms [PDF]
ACM 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
Graph Algorithm Animation with Grrr [PDF]
, 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
Order Reconfiguration under Width Constraints [PDF]
, 2023 In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in such a way that, at each time ...
Petra Wolf +10 more
core +1 more source
A survey of graph-based algorithms for discovering business processes
IJAIN (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
Algorithms, 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
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
, 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
Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks
Mathematics, 2021 The increasing trend of GPS-enabled smartphones has led to the tremendous usage of Location-Based Service applications. In the past few years, a significant amount of studies have been conducted to process All nearest neighbor (ANN) queries. An ANN query
Aavash Bhandari +4 more
doaj +1 more source
Algorithms on evolving graphs [PDF]
Proceedings 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 +3 more sources