[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Iordanski, 2020 - Google Patents

Constructive Graph Theory: Generation Methods, Structure and Dynamic Characterization of Closed Classes of Graphs--A survey

Iordanski, 2020

View PDF
Document ID
3041616496343885086
Author
Iordanski M
Publication year
Publication venue
arXiv preprint arXiv:2011.10984

External Links

Snippet

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced. The generating bases …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Stasheff H-spaces from a homotopy point of view
Reutter et al. Biunitary constructions in quantum information
Liu A counterexample to the extension space conjecture for realizable oriented matroids
Badia et al. A generic finite element framework on parallel tree-based adaptive meshes
Ovsienko A step towards cluster superalgebras
Holke et al. An optimized, parallel computation of the ghost layer for adaptive hybrid forest meshes
Iordanski Constructive Graph Theory: Generation Methods, Structure and Dynamic Characterization of Closed Classes of Graphs--A survey
Gurau et al. Duality of orthogonal and symplectic random tensor models
Iranmanesh et al. Finite symmetric graphs with two-arc transitive quotients
Gaifullin 634 vertex-transitive and more than $10^{103} $ non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane
Egri-Nagy et al. Computational holonomy decomposition of transformation semigroups
Goldfeather et al. Quadratic surface rendering on a logic-enhanced frame-buffer memory
Tarau An embedded declarative data transformation language
Doran et al. From polygons to string theory
Cai et al. Degree-bounded spanners
Kápolnai et al. Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes
Tarau " Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms
Gao et al. Novel quantum algorithms to minimize switching functions based on graph partitions
Medina-Mardones The diagonal of cellular spaces and effective algebro-homotopical constructions
Pantziou et al. Efficient parallel algorithms for shortest paths in planar digraphs
Mörtberg Cubical methods in homotopy type theory and univalent foundations
Fabre-Monplaisir et al. Isometries of the hypercube: A tool for Boolean regulatory networks analysis
Ravve et al. Four scenarios of effective computations on sum-like graphs
Anderson A network definition and solution of simulation problems
Erokhovets Theory of Families of Polytopes: Fullerenes and Pogorelov Polytopes