An approach to improving the Mayeda method for graph realization from a matrix (Q941170): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s00034-007-9006-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066919768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contect-free language and enumeration problems on infinite trees and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309631 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:08, 28 June 2024

scientific article
Language Label Description Also known as
English
An approach to improving the Mayeda method for graph realization from a matrix
scientific article

    Statements

    An approach to improving the Mayeda method for graph realization from a matrix (English)
    0 references
    0 references
    4 September 2008
    0 references
    network analysis
    0 references
    graph realization
    0 references
    \(M\) submatrix
    0 references
    Mayeda method
    0 references

    Identifiers