z-logo
open-access-imgOpen Access
From graphs to DAGs: a low-complexity model and a scalable algorithm
Author(s) -
Dong, Shuyu,
Sebag, Michèle
Publication year - 2022
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - directed acyclic graph , computational complexity theory , low rank approximation , differentiable function , algorithm , scalability , directed graph , computer science , reduction (mathematics) , matrix decomposition , matrix (chemical analysis) , rank (graph theory) , mathematics , combinatorics , tensor (intrinsic definition) , eigenvalues and eigenvectors , mathematical analysis , geometry , materials science , database , pure mathematics , composite material , physics , quantum mechanics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom