Tagged articles
Graph Algorithms
57 articles · Page 1 of 1

AntTechJul 14, 2026 · Artificial Intelligence
This article reviews three ICML 2026 papers that introduce a user‑centric benchmark for mobile GUI agents, a path‑likelihood optimizer for diffusion language models, and a graph‑structured framework that prunes training datasets without sacrificing accuracy.
Dataset pruningDiffusion LLMGraph Algorithms
0 likes · 8 min read

This tutorial walks through implementing core algorithms and data structures in Go, covering language basics, arrays, slices, linked lists, stacks, queues, trees, graphs, sorting and searching techniques, as well as dynamic programming and greedy strategies, with concrete code examples and performance considerations.
AlgorithmsGoGraph Algorithms
0 likes · 32 min read

This article reviews two SIGMOD 2026 papers—MASC, which redefines multi‑query subgraph matching by maximizing shared computation to achieve up to two orders of magnitude speedup, and PrivHop, which combines 2‑hop labeling with secure multi‑party computation to enable privacy‑preserving shortest‑path queries on million‑node graphs with roughly a million‑fold reduction in runtime and communication.
Graph AlgorithmsMPCShortest Path
0 likes · 5 min read

This article presents the OAG (Ontology‑Augmented Generation) architecture, which uses a three‑stage pipeline of semantic filtering, graph‑based path pruning, and format conversion to compress enterprise‑scale ontologies by up to 89% of tokens while limiting inference accuracy loss to around 3% and adding only ~240 ms latency.
AI agentsGraph AlgorithmsLLM
0 likes · 21 min read

A new shortest‑path algorithm developed by researchers at Tsinghua University claims to overcome the long‑standing sorting bottleneck of Dijkstra’s classic method, extending to both undirected and directed graphs and sparking fresh debate on algorithmic optimality and future research directions.
DijkstraGraph AlgorithmsShortest Path
0 likes · 10 min read

This article explores how black‑market cheating in marketing campaigns and e‑commerce is detected using graph‑based techniques such as same‑person mining, label propagation, Fraudar, and GCN models, and discusses future directions like multimodal data fusion and real‑time dynamic graph computation.
Anti-FraudFraudarGCN
0 likes · 18 min read

This article walks through the problem of finding the shortest route in a smart‑traffic graph, explains Dijkstra's greedy algorithm step by step, illustrates the process with a narrative example, and provides complete Python code using heapq for priority‑queue management.
DijkstraGraph AlgorithmsHeapq
0 likes · 30 min read

This article presents a comprehensive study on leveraging user propagation ability metrics for friend recommendation and influence maximization in gaming environments, introducing a conversion‑funnel‑aware diffusion model, novel influence‑maximization variants, efficient greedy algorithms, and extensive offline and online experiments that demonstrate significant performance gains over traditional methods.
Graph Algorithmsgaminginfluence maximization
0 likes · 16 min read

This article introduces Neo4j, explains its property‑graph model, demonstrates how to write and optimize Cypher queries, explores advanced features like full‑text search and built‑in graph algorithms, and showcases real‑world use cases and integration options for modern applications.
CypherGraph AlgorithmsGraph Queries
0 likes · 10 min read

This article introduces the open‑source Python library communities, which provides implementations of several community‑detection algorithms—including Louvain, Girvan‑Newman, hierarchical clustering, spectral clustering, and Bron‑Kerbosch—along with installation instructions, usage examples, and visualization tools for network analysis.
Community DetectionGraph Algorithmsmachine-learning
0 likes · 6 min read

This article details the design, architecture, modular implementation, and practical use cases of Tencent Oula's data lineage platform, covering background goals, system components, graph‑based algorithms, SQL parsing, cost‑allocation insights, and a Q&A session for data engineers and analysts.
Graph AlgorithmsSQL parsingTencent Oula
0 likes · 20 min read

This article compiles recent resources on evaluation and optimization models, covering fundamental concepts, data preprocessing techniques, weighting methods such as TOPSIS and entropy, as well as linear and integer programming, graph theory, network algorithms, and meta‑heuristic approaches like simulated annealing and genetic algorithms.
Graph AlgorithmsLinear ProgrammingOperations Research
0 likes · 3 min read

This article explains the definition and properties of directed acyclic graphs (DAG), describes the basic topological sorting algorithm steps, and provides a complete Java implementation using Guava's MutableGraph class, illustrating the process with an example and its execution result.
DAGGraph AlgorithmsGuava
0 likes · 4 min read

This article explains the fundamentals of community detection in graph computing, contrasting it with clustering, describing key concepts such as modularity, and reviewing classic algorithms like Louvain, node2vec‑based methods, and Infomap, while highlighting their applications across domains.
Community DetectionGraph AlgorithmsInfomap
0 likes · 11 min read

This article introduces community detection as a fundamental graph algorithm, explains its basic concepts and types, compares it with clustering, discusses evaluation metrics like modularity, and reviews classic methods such as Louvain, node2vec‑based approaches, and the information‑theoretic Infomap algorithm.
Community DetectionGraph AlgorithmsInfomap
0 likes · 13 min read

This article presents Ant Group's work on knowledge graphs, covering the fundamentals, construction pipeline, fusion techniques, cognitive modeling, real‑world applications, and the emerging synergy between knowledge graphs and large language models, while highlighting technical challenges and future directions.
AIAnt GroupApplications
0 likes · 13 min read

This presentation details how Wing Payment leverages a large‑scale, multimodal knowledge graph and AI techniques—including computer vision, unsupervised and supervised learning, federated learning, and graph neural networks—to detect and mitigate fraud across payment, e‑commerce, and credit scenarios, while outlining system architecture, algorithmic approaches, case studies, and future research directions.
Financial ServicesGraph AlgorithmsMultimodal Data
0 likes · 17 min read

This article discusses the challenges of loop detection in financial risk control, presents distributed graph computing optimization techniques—including pruning, multi‑graph handling, and memory‑efficient algorithms—shows experimental results, and shares real‑world ArcNeural engine case studies and future directions.
ArcNeuralGraph AlgorithmsLoop Detection
0 likes · 13 min read

This article presents a comprehensive overview of the Comet workflow engine, detailing its background, architecture, key design concepts, graph‑based legality checks, plugin mechanisms, and practical use cases such as SRE automation, permission requests, and dynamic linear processes, illustrating how a flexible, low‑code platform can streamline enterprise business flows.
Graph AlgorithmsWorkflowautomation
0 likes · 18 min read

The Intelligent Risk Control Forum gathers experts from Tencent, Huawei, Ant Group and academia to present the latest research on graph‑based algorithms, loop detection, pre‑trained graph neural networks, active learning and unstructured‑data risk models, addressing challenges such as data sparsity, adversarial behavior and model robustness.
Graph AlgorithmsLoop DetectionRisk Control
0 likes · 8 min read

The article presents a comprehensive overview of how graph algorithms are applied in Alibaba's e‑commerce risk control system, detailing six sections that include risk scenario introductions, interaction and product content risk methods, dynamic heterogeneous graph practices, a large‑scale competition, and future research directions.
Dynamic GraphGraph AlgorithmsGraph Neural Networks
0 likes · 18 min read

Delta-net introduces an interval‑based Atom model and a directed‑graph verification algorithm that enable sub‑millisecond, incremental detection of forwarding loops, blackholes, and reachability issues in large, complex networks, as demonstrated by microsecond‑scale performance tests on real hardware.
AtomsDelta-netGraph Algorithms
0 likes · 6 min read

This article explains the shortest path problem in graph theory, presents its integer linear programming model, reviews classic algorithms such as Dijkstra, Bellman‑Ford, and Floyd‑Warshall, and demonstrates solving a city‑flight cost example using Python’s NetworkX library with code snippets.
DijkstraGraph AlgorithmsLinear Programming
0 likes · 7 min read

This article analyzes the use of graph neural network models, including GCN and multi‑graph SCGCN, to tackle cheating in referral‑based user acquisition by capturing user relationships, improving sample purity, and achieving up to a 50% increase in cheat‑sample recall.
GCNGraph AlgorithmsGraph Neural Networks
0 likes · 12 min read

This interview summarizes experts' insights on graph algorithm technology, covering its early industrial adoption, data scale and sparsity challenges, various graph types and models, application scenarios such as recommendation and risk control, R&D workflow hurdles, and emerging research directions like pre‑training, explainability, and combinatorial optimization.
ApplicationsGraph AlgorithmsGraph Neural Networks
0 likes · 14 min read

This article presents a comprehensive overview of how graph algorithms and graph neural networks are applied to internet risk control, covering basic concepts, evolutionary trends, platform implementations, future challenges, and a Q&A session that bridges theory and practice.
Graph AlgorithmsGraph Neural NetworksRisk Control
0 likes · 19 min read

This article presents a comprehensive AI‑driven framework for merchant security that covers authenticity recognition through credential, text, and transaction analysis, advanced risk detection using self‑supervised, semi‑supervised, and graph‑based models, and intelligent decision‑making to balance risk mitigation with user experience.
AI risk detectionGraph Algorithmsintelligent decision
0 likes · 17 min read

This article explains how the data challenges of modern intelligent supply chains can be addressed by using graph databases and knowledge graphs, detailing supply chain background, graph database fundamentals, graph algorithms, and real‑world case studies that illustrate risk assessment and logistics optimization.
Graph AlgorithmsNeo4jgraph database
0 likes · 18 min read

This article lists the key SciPy sparse‑graph functions—such as connected components, Laplacian, various shortest‑path algorithms, traversals, minimum spanning tree, flow and matching utilities—and provides Python code examples demonstrating their use.
Graph AlgorithmsPythonShortest Path
0 likes · 4 min read

The Louvain algorithm, a fast modularity‑maximizing community‑detection method, iteratively merges nodes into hierarchical super‑nodes, enabling anti‑fraud systems to uncover hidden collusive groups in weighted transaction graphs, thereby improving detection of fake orders, coupon abuse, and other illicit behaviors despite its iterative nature and streaming limitations.
Anti-FraudCommunity DetectionGraph Algorithms
0 likes · 10 min read

This article presents a comprehensive overview of deploying and running graph learning algorithms—both inductive and transductive—on the secure Spark cluster, covering framework choices, data sampling strategies, distributed training techniques, model evaluation metrics, and future directions.
Graph AlgorithmsSparkbig data
0 likes · 13 min read

This article describes Ant Group's merchant knowledge graph, covering its background, overall architecture, data sources, schema design, processing pipeline, cross‑graph fusion techniques, cognitive applications such as vector‑based recall, and the upcoming open‑source and SDK initiatives aimed at sharing the knowledge and tools with the community.
AIGraph Algorithmsknowledge graph
0 likes · 20 min read

This article introduces the classic shortest‑path problem in graph theory, explains major algorithms such as Dijkstra, Bellman‑Ford, Floyd and A*, discusses their strengths and limitations, and demonstrates their application to a city‑ticket pricing case using Python’s NetworkX library.
A*Bellman-FordDijkstra
0 likes · 6 min read

This article explores how graph machine learning can be leveraged for intelligent anti‑fraud, covering business background, common fraud models and graph algorithm principles, practical deployment of graph algorithms, challenges in fraud modeling, and future research directions.
Graph AlgorithmsGraph Machine LearningUnsupervised Learning
0 likes · 20 min read

This article explains how Douyu leverages graph algorithms for live‑stream traffic anti‑cheat, detailing the platform’s risk scenarios, the overall graph architecture, its evolution, modeling workflow, practical case studies, and the resulting improvements in fraud detection and interpretability.
AIGraph Algorithmsanti-cheat
0 likes · 16 min read

This article explains how Douyu uses graph‑based algorithms to detect and mitigate fraudulent streaming traffic, covering the platform's risk‑control scenarios, the overall graph architecture, its evolution, modeling workflow, practical case studies, and the resulting improvements in detection accuracy and interpretability.
Graph AlgorithmsRisk Controlanti-cheat
0 likes · 16 min read

This article provides a comprehensive overview of data structures and algorithms, covering fundamental concepts such as data, elements, objects, logical and storage structures, common structures like lists, stacks, queues, trees, graphs, algorithm design techniques, complexity analysis, and includes visual resources and code examples.
AlgorithmsComplexityGraph Algorithms
0 likes · 33 min read

This teaching plan outlines a comprehensive Knowledge Graph course covering fundamentals, representation, storage, extraction, reasoning, fusion, question answering, graph algorithms, and emerging technologies across nine detailed chapters, including language integration, ontology matching, and multimodal extensions.
Graph Algorithmsartificial intelligencecourse syllabus
0 likes · 4 min read

This article introduces core data structures—hash tables, heaps, and graphs—explains their definitions, visual representations, and key operations, then delves into fundamental graph algorithms such as BFS, Dijkstra, Floyd, minimum spanning trees, and topological sorting, illustrating each with examples and code.
DijkstraGraph AlgorithmsHeap
0 likes · 16 min read

This article explains how various graph algorithms—including connected components, label propagation, Louvain community detection, and Graph Convolutional Networks—are built on large‑scale user‑behavior graphs using Spark GraphX to detect and mitigate advertising fraud, detailing methodology, implementation, and experimental results.
Anti-FraudGCNGraph Algorithms
0 likes · 13 min read

This article presents a comprehensive study on using graph representation learning, particularly GraphSAGE and its optimizations, to identify and mitigate black‑market accounts in virtual networks, covering background, algorithm design, handling isolated nodes and heterogeneity, and evaluation results.
Graph AlgorithmsGraphSAGERepresentation Learning
0 likes · 13 min read

This article presents a comprehensive overview of using graph representation learning and clustering, particularly GraphSAGE and its optimizations, to identify and mitigate black‑market (malicious) accounts in virtual networks, discussing background, objectives, challenges such as isolation and heterogeneity, and evaluation results.
Graph AlgorithmsGraphSAGEblack market detection
0 likes · 13 min read

This article explains how financial institutions can leverage massive structured and unstructured data by building a financial knowledge graph, detailing AI core technologies, schema design, extraction methods, storage solutions, and a range of practical applications such as intelligent tagging, recommendation, policy analysis, and executive relationship mining.
Graph AlgorithmsSemantic Searchartificial intelligence
0 likes · 16 min read

The article explains how building account relationship graphs and applying both traditional graph algorithms and modern graph neural networks—through community detection, anomaly detection, semi‑supervised and unsupervised learning, and dynamic graph techniques—can effectively identify and dismantle fraud groups in online services.
AIGraph Algorithmsdynamic graphs
0 likes · 11 min read


58 TechNov 18, 2020 · Artificial Intelligence
This article describes how graph theory and graph convolutional neural networks are leveraged to model user‑IP relationships, detect fraudulent advertising clusters, and improve detection accuracy and recall through a combination of unsupervised graph algorithms and supervised GCN training in a large‑scale ad‑anti‑fraud system.
AdvertisingAnti-FraudGCN
0 likes · 14 min read

This article introduces ten essential algorithms—including Quick Sort, Heap Sort, Merge Sort, Binary Search, BFPRT, Depth‑First Search, Breadth‑First Search, Dijkstra's shortest‑path, Dynamic Programming, and Naive Bayes—explaining their principles, typical use cases, and step‑by‑step procedures.
AlgorithmsGraph Algorithmsdynamic programming
0 likes · 12 min read

The article presents a comprehensive overview of e‑commerce fraud, especially brush‑order schemes, and introduces the Fraudar algorithm—a graph‑based unsupervised method that leverages bipartite network analysis, global suspiciousness metrics, priority‑tree optimization, and collaborative supervised training to efficiently identify dense fraudulent sub‑graphs.
FraudarGraph AlgorithmsUnsupervised Learning
0 likes · 15 min read

The article explains how e‑commerce fraud such as fake order brushing can be modeled as a bipartite transaction network and tackled with the Fraudar algorithm, which iteratively removes low‑suspicion nodes using a global suspiciousness metric and priority‑tree structures to uncover dense suspicious sub‑graphs.
Graph AlgorithmsUnsupervised Learningbipartite graph
0 likes · 14 min read

The article introduces LPA-Detector, an open‑source project that redesigns the Label Propagation Algorithm using Spark GraphX to add node confidence weights and relationship influence, achieving significant improvements in execution efficiency and detection accuracy for massive graph data in risk‑control scenarios.
Graph AlgorithmsSparkbig data
0 likes · 8 min read

This comprehensive guide explores a wide range of anomaly detection techniques—including time‑series methods, statistical models, distance‑based approaches, tree‑based isolation forests, graph algorithms, behavior‑sequence Markov models, and supervised machine‑learning models—detailing their principles, formulas, and practical scenarios for detecting outliers in advertising, fraud, and system monitoring.
Graph AlgorithmsIsolation ForestTime Series
0 likes · 19 min read

This article explains how graph‑based algorithms such as centrality measures, modularity optimization, Louvain, Infomap, node2vec and the comE framework can be applied to financial fraud detection and community discovery, detailing their principles, formulas, implementation steps and evaluation metrics.
Community DetectionGraph AlgorithmsInfomap
0 likes · 14 min read


21CTOSep 26, 2017 · Big Data
Introducing the NTE (New Triangle Enumeration) algorithm, a divide‑and‑conquer approach that transforms the computation of newly added common friends in massive social graphs into efficient triangle enumeration tasks, with detailed implementations using GraphX‑based GTE, join‑based JTE, and sort‑based STE methods.
Graph AlgorithmsGraphXSocial Network Analysis
0 likes · 12 min read


ITPUBApr 24, 2017 · Fundamentals
This article provides a concise reference of core algorithms—including sorting methods, graph traversals, shortest‑path techniques, greedy strategies, bit‑level manipulations, and asymptotic notation—detailing their stability, time complexities, key concepts, and practical examples for interview preparation.
AlgorithmsComplexityGraph Algorithms
0 likes · 8 min read

This article explains the PageRank algorithm, illustrates its principles with a loan‑club trust‑score example, and shows how to compute and analyze PageRank on large graphs using the Graphene platform, including detailed SQL steps and performance comparisons.
Graph AlgorithmsPageRankgraphene
0 likes · 11 min read

This article presents concise explanations and step‑by‑step procedures for ten classic algorithms—including quick sort, heap sort, merge sort, binary search, BFPRT selection, depth‑first and breadth‑first graph traversals, Dijkstra’s shortest‑path method, dynamic programming principles, and the Naive Bayes classifier—highlighting their complexities and core ideas.
Graph AlgorithmsSearchingalgorithm fundamentals
0 likes · 11 min read


21CTOFeb 29, 2016 · Fundamentals
This article presents concise explanations, step‑by‑step procedures, and visual illustrations for ten core algorithms—including QuickSort, HeapSort, MergeSort, Binary Search, BFPRT, DFS, BFS, Dijkstra, Dynamic Programming, and Naive Bayes—highlighting their principles, complexities, and typical use cases.
Graph AlgorithmsSearch AlgorithmsSorting Algorithms
0 likes · 15 min read

This article explains how Baidu Maps introduced a dedicated cycling navigation service in 2015, compares traditional A* routing with the innovative High Dijkstra (HD) algorithm, and details the three development sprints that dramatically improved route optimality and performance for cyclists.
DijkstraGraph AlgorithmsRouting
0 likes · 9 min read
