
MCODE
 Referenced in 49 articles
[sw35748]
 This paper describes a novel graph theoretic clustering algorithm, ”Molecular Complex Detection” (MCODE), that detects ... given parameters. The algorithm has the advantage over other graph clustering methods of having...

SparseMatrix
 Referenced in 747 articles
[sw04629]
 development and performance evaluation of sparse matrix algorithms. It allows for robust and repeatable experiments ... optimization, circuit simulation, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics ... statistics, power networks, and other networks and graphs). We provide software for accessing and managing...

PIGALE
 Referenced in 29 articles
[sw05435]
 algorithm library essentially concerned with planar graphs. This software is particularly intended for graph theoretical...

Graphs
 Referenced in 109 articles
[sw12277]
 presented with a network (graph). A socalled preprocessing algorithm may compute certain information ... from various communities (sometimes under different names): algorithm engineers construct fast route planning methods; database ... spatial networks, and reachability queries; and theoretical computer scientists analyze distance oracles and sparse spanners ... this survey, we review selected approaches, algorithms, and results on shortestpath queries from these...

Parkway
 Referenced in 7 articles
[sw12863]
 Karypis’ parallel multilevel graph partitioning algorithm. This good theoretical scalability is backed up by empirical...

McVol
 Referenced in 2 articles
[sw20199]
 identifying cavities by a Monte Carlo algorithm. n this paper, we describe a Monte Carlo ... This method in combination with a graphtheoretical algorithm is used to detect internal cavities...

PedPeel
 Referenced in 1 article
[sw10511]
 many pedigree members have unknown genotypes. Several algorithms have been proposed to address this problem ... until now. We suggest a new graph theoretic algorithm for optimal selection of peeling order...

gCol
 Referenced in 26 articles
[sw41492]
 introductory chapters explain graph colouring, and bounds and constructive algorithms. The author then shows ... practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence...

TADD
 Referenced in 8 articles
[sw02821]
 Using a graph theoretical formulation of this theory, we present an algorithmic pipeline that computes...

GenerateUHG
 Referenced in 5 articles
[sw26974]
 exhaustive generation of nonisomorphic graphs with a given number k≥0 of hamiltonian cycles ... combining applications of this algorithm and existing algorithms with new theoretical results, revolve around graphs...

UnitWalk
 Referenced in 36 articles
[sw00993]
 graph coloring problems to microprocessor verification. Our algorithm is inspired by two randomized algorithms having ... main ideas of these algorithms in one algorithm. The two approaches we use are local ... search (which is used in many SAT algorithms, e.g., in GSAT and WalkSAT) and unit ... local search algorithms). In this paper we do not prove any theoretical bounds. However...

CDMA/OVSF
 Referenced in 12 articles
[sw03215]
 Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks We present several distributed ... code assignment algorithms for wireless ad hoc networks modelled by unit disk graph...

SESync
 Referenced in 12 articles
[sw40678]
 Nevertheless, in this paper we present an algorithm that is able to efficiently recover certifiably ... exploiting its lowrank, geometric, and graphtheoretic structure to reduce it to an equivalent ... algorithm, SESync. Experimental evaluation on a variety of simulated and realworld posegraph...

RECFMM
 Referenced in 6 articles
[sw21760]
 systems  CILK in particular, which provides graphtheoretic optimal scheduling in adaptation to the dynamics ... parallel execution  are employed. RECFMM supports multiple algorithm variants that mark the major advances with...

GATO
 Referenced in 8 articles
[sw08580]
 developed to handle the internal separatrix. Efficient algorithms have been developed to solve the matrix ... Further improvement is expected using graph theoretical techniques to reorder the matrices. Using judicious mesh...

ReebHanTun
 Referenced in 6 articles
[sw28352]
 time considerably for large meshes making the algorithm scalable while computing the loops ... concept of the Reeb graph which together with several key theoretical insights on linking number ... demonstrate the efficiency and effectiveness of our algorithm as well as show its robustness against...

Peklo
 Referenced in 0 articles
[sw05763]
 visualizing and comparing different algorithms for some graph theoretic problems. Currently implemented are algorithms...

KADABRA
 Referenced in 4 articles
[sw25810]
 approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches ... efficiency of the new algorithm relies on two new theoretical contributions, of independent interest ... most algorithms that approximate betweenness centrality. We show that, on realistic random graph models...

EmptyHeaded
 Referenced in 3 articles
[sw32535]
 magnitude slower than the lowlevel graph engines. We present EmptyHeaded, a highlevel engine ... class of join algorithms that satisfy strong theoretical guarantees but have thus far not achieved ... performance comparable to that of specialized graph processing engines. To achieve high performance, EmptyHeaded introduces...

PyGModels
 Referenced in 1 article
[sw38510]
 graphtheoretical and statistical properties, which allows users to explore and test inference algorithms that ... rooted in graph theory or statistics. PyGModels also implements several algorithms of interest on Lauritzen...