A Depth-First Search Algorithm for Computing Pseudo-Closed Sets

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2018.03.030
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Depth-First Search Algorithm to Compute Elementary Flux Modes by Linear Programming

BMC Systems Biology
Molecular BiologyApplied MathematicsStructural BiologySimulationComputer Science ApplicationsModeling
2014English

Concurrent Depth-First Search Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Grover’s Algorithm for Multiobject Search in Quantum Computing

English

Search for Linearizing Sets in Algebraic Cryptanalysis as a Problem of Pseudo-Boolean Optimization

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

A Simple Algorithm for Computing Projection Onto Intersection of Finite Level Sets

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2014English

A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Between Closed Sets and G𝝎-Closed Sets

IOSR Journal of Mathematics
2017English

On External-Memory Planar Depth-First Search

2006English

Minimal Closed Sets and Maximal Closed Sets

International Journal of Mathematics and Mathematical Sciences
Mathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy