ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Familiarity with Directed Acyclic Graphs (DAGs)”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DScs.CCTheoreticalRecentJun 16, 2026

Directed Reachability-Preserving Minimum Edge Cut: Approximation and Planar Hardness

Qi Duan

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

View →
cs.DSmath.COTheoreticalRecentJul 28, 2026

Optimization of the directed spanning trees using the weighted matroid intersection algorithm

Binhong Jiang, Gehao Wang

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

View →
cs.HCEmpiricalRecentJul 15, 2026

ZipLine: Visual Analysis of Multivariate Graphs with Predicate Logic

Sjoerd Vink, Suyang Li, Brian Montambault, Michael Behrisch +2 more

This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.

View →
cs.AIRecentMay 29, 2026

GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning

Saku Peltonen, August Bøgh Rønberg, Andreas Plesner, Roger Wattenhofer

The paper introduces GraphARC, a new benchmark for abstract reasoning on graph-structured data, demonstrating that current state-of-the-art language models struggle with full graph transformation task…

View →
cs.AIEmpiricalRecentJun 30, 2026

AxDafny: Agentic Verified Code Generation in Dafny

Benjamin Breen, Austin Letson, Borja Requena Pozo, Leopoldo Sarra

The paper introduces AxDafny, a verifier-guided repair framework that improves verification success in Dafny by generating implementations, invariants, assertions, and termination arguments.

View →
cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

View →
cs.CCTheoreticalRecentJul 21, 2026

On the Complexity of Graph Edit Distance in Restricted Graph Classes

Maximilian Limmer, Nils M. Kriege

The paper investigates the relationship between graph classes, edit cost functions, and computational complexity of the graph edit distance, providing polynomial-time reductions and correspondences.

View →
cs.LGstat.MEstat.MLTheoreticalRecentJul 9, 2026

Structure Learning on Clustered Data

Ryan Thompson, Matt P. Wand, Veerabhadran Baladandayuthapani

This paper introduces a new approach for scalable causal discovery in directed acyclic graphs (DAGs) with clustered data and local cluster-level effects.

View →
cs.DMTheoreticalRecentJul 8, 2026

Canonical Join Trees

Arne Leitert

This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.

View →
cs.PLTheoreticalRecentJun 26, 2026

Prophecy-Based Automated Verification of Message-Passing Programs

Takashi Nagatomi, Musashi Katsura, Naoki Kobayashi, Yusuke Matsushita +1 more

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

View →
cs.LGcs.AIRecentMay 28, 2026

Quotient DAGs for Off-Policy Evaluation:Forward-Flow Importance Sampling and Exact Slate Propensities

Ziwen Xie, Shaowen Xiang, Hongyu He, Dianbo Liu

The paper introduces a quotient-DAG view to accurately estimate unordered slate propensities for off-policy evaluation, solving the nuisance variance and computational gap inherent in standard importa…

View →
cs.AIRecentMay 29, 2026

Generating Graph-like Rules for Knowledge Graph Reasoning via Diffusion Models

Haoxiang Cheng, Yunfei Wang, Chao Chen, Kewei Cheng +4 more

The paper proposes GRiD, a novel framework that uses a two-phase training strategy (supervised pre-training and RL fine-tuning) to discover complex, graph-like rules for knowledge graph reasoning, ove…

View →
cs.AIRecentJun 1, 2026

Consistency evaluation of benchmarks used for causal discovery

Yuzhe Zhang, Chihui Chen, Lina Yao, Chen Wang

This paper systematically evaluates the consistency of popular causal discovery benchmarks against real-world scientific literature, revealing significant variability in their accuracy.

View →