Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (Q4589248): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references