Login / Signup
Hardness and efficiency on t-admissibility for graph operations.
Fernanda Couto
Luís Felipe I. Cunha
Published in:
Discret. Appl. Math. (2021)
Keyphrases
</>
computational complexity
graph theory
connected components
graph representation
bit wise
graph model
directed graph
random walk
np complete
special case
learning theory
database systems
learning algorithm
genetic algorithm
graph theoretic
adjacency matrix
neural network