Cargando…
An algorithm for constructing the skeleton graph of degenerate systems of linear inequalities
Derive the quantitative predictions of constraint-based models require of conversion algorithms to enumerate and construct the skeleton graph conformed by the extreme points of the feasible region, where all constraints in the model are fulfilled. The conversion is problematic when the system of lin...
Autores principales: | Méndez Martínez, José Manuel, Urías, Jesús |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5391119/ https://www.ncbi.nlm.nih.gov/pubmed/28406983 http://dx.doi.org/10.1371/journal.pone.0175819 |
Ejemplares similares
-
Graphs for pattern recognition: infeasible systems of linear inequalities
por: Gainanov, Damir
Publicado: (2016) -
Maximally nonlocal Clauser-Horne-Shimony-Holt scenarios
por: Urías, Jesús, et al.
Publicado: (2018) -
Using Direct Acyclic Graphs to Enhance Skeleton-Based Action Recognition with a Linear-Map Convolution Neural Network
por: Tan, Tan-Hsu, et al.
Publicado: (2021) -
Shallow Graph Convolutional Network for Skeleton-Based Action Recognition
por: Yang, Wenjie, et al.
Publicado: (2021) -
Sparsity: Graphs, Structures, and Algorithms
por: Nešetril, Jaroslav, et al.
Publicado: (2012)