Results 11 to 20 of about 827,001 (270)

Outlier edge detection using random graph generation models and applications [PDF]

Journal of Big Data, 2017
Outliers are samples that are generated by different mechanisms from other normal data samples. Graphs, in particular social network graphs, may contain nodes and edges that are made by scammers, malicious programs or mistakenly by normal users ...
Honglei Zhang, Serkan Kiranyaz, Moncef Gabbouj   +2 more
doaj   +5 more sources

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

Dynamic Algorithms for Graph Coloring [PDF]

, 2017
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika, Nanongkai, Danupon   +3 more
core   +2 more sources

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

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, Dasgupta, Anirban, Kumar, Ravi, Lattanzi, Silvio, Sarlós, Tamás   +4 more
core   +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, Geneviève Simonet, Jean R.S. Blair, Anne Berry   +3 more
doaj   +1 more source

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

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, A.V. Kostochka, A.V. Kostochka, C. Cheng, G. Borradaile, K. Edwards, M.M. Halldórsson   +6 more
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á, Kitti Páleníková, Ľubomír Rybanský, Zuzana Naštická   +3 more
doaj   +1 more source

Leanness Computation: Small Values and Special Graph Classes [PDF]

Discrete Mathematics & Theoretical Computer Science
Let 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, Samuel Coulomb, Guillaume Ducoffe   +2 more
doaj   +1 more source