Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (Q4589248): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3233/fi-2016-1448 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2563204801 / rank | |||
Normal rank | |||
Latest revision as of 08:22, 30 July 2024
scientific article; zbMATH DE number 6804766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices |
scientific article; zbMATH DE number 6804766 |
Statements
Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (English)
0 references
9 November 2017
0 references
positive unit forms
0 references
Dynkin-type
0 references
edge-bipartite graphs
0 references
combinatorial algorithms
0 references
