Results 21 to 30 of about 832,460 (272)
On sampling nodes in a network [PDF]
, 2016 Random walk is an important tool in many graph mining applications including estimating graph parameters, sampling portions of the graph, and extracting dense communities.
CHIERICHETTI, FLAVIO +4 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
Achieving Good Angular Resolution in 3D Arc Diagrams [PDF]
, 2013 We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D ...
A. Cimikowski +17 more
core +2 more sources
Average Sensitivity of Graph Algorithms
, 2020 In modern applications of graphs algorithms, where the graphs of interest are large and dynamic, it is unrealistic to assume that an input representation contains the full information of a graph being studied.
Varma, Nithin, Yoshida, Yuichi
core +1 more source
Undergraduate Students’ Solutions of Modeling Problems in Algorithmic Graph Theory
Mathematics, 2019 Graphs can be considered as useful mathematical models. Graph algorithms are a common part of undergraduate courses in discrete mathematics. Even though they have been successfully implemented in secondary curricula, little research has been dedicated to
Janka Medová +3 more
doaj +1 more source
Planar Induced Subgraphs of Sparse Graphs [PDF]
, 2014 We show that every graph has an induced pseudoforest of at least $n-m/4.5$ vertices, an induced partial 2-tree of at least $n-m/5$ vertices, and an induced planar subgraph of at least $n-m/5.2174$ vertices. These results are constructive, implying linear-
A. Lubotzky +6 more
core +1 more source
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert +2 more
doaj +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