Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System (Q4692095): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2248700
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Evgeny Ivanko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2778803245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the reduction of finite non-oriented graphs to canonical form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank

Latest revision as of 02:15, 17 July 2024

scientific article; zbMATH DE number 6966199
Language Label Description Also known as
English
Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System
scientific article; zbMATH DE number 6966199

    Statements

    Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System (English)
    0 references
    26 October 2018
    0 references
    closed semantic system
    0 references
    graph isomorphism
    0 references
    0 references
    0 references
    0 references

    Identifiers