Výsledky vyhledávání - graph theory with algorithmic applications

Upřesnit hledání
  1. 1

    Graph Algorithms and Applications

    ISBN: 9783036515410, 3036515410, 3036515429, 9783036515427
    Vydáno: Basel MDPI - Multidisciplinary Digital Publishing Institute 2022
    “… This book contains some papers reporting recent achievements regarding graph models, algorithms, and applications to problems in the real world, with some focus…”
    Získat plný text
    E-kniha
  2. 2

    Special Issue on “Graph Algorithms and Applications Autor Cicerone, Serafino, Di Stefano, Gabriele

    ISSN: 1999-4893, 1999-4893
    Vydáno: Basel MDPI AG 01.05.2021
    Vydáno v Algorithms (01.05.2021)
    “… For instance, more recently, graphs have found new applications in solving problems for emerging research fields such as social network analysis, design of robust computer network topologies…”
    Získat plný text
    Journal Article
  3. 3

    Extremal problems in combinatorial geometry and graph theory with algorithmic applications Autor Toth, Geza

    ISBN: 9780591407907, 0591407906
    Vydáno: ProQuest Dissertations & Theses 01.01.1997
    “…According to Ramsey's classical theorem, every graph contains a relatively large subgraph which is either complete or empty…”
    Získat plný text
    Dissertation
  4. 4

    Some Relations of Subsequences in Permutations to Graph Theory with Algorithmic Applications Autor Rotem, Doron

    ISBN: 9798661869791
    Vydáno: ProQuest Dissertations & Theses 01.01.1977
    “…The representation of some types of graphs as permutations, is utilized in devising efficient algorithms on those graphs…”
    Získat plný text
    Dissertation
  5. 5
  6. 6

    Mathematical Studies in Deep Learning: Overparameterization Theories, Graph Generative Models and Applications in Algorithmic Pricing Autor Guo, Yinglong

    ISBN: 9798346867524
    Vydáno: ProQuest Dissertations & Theses 01.01.2024
    “… selection for such networks. Second, it proposes a novel graph data generation method, introducing an unpooling layer that leverages graph structures and resolves the non-differentiability in training using the policy gradient approach…”
    Získat plný text
    Dissertation
  7. 7

    Exploiting graph theory in MD simulations for extracting chemical and physical properties of materials Autor Bougueroua, Sana, Kolganov, Alexander A, Helain, Chloé, Zens, Coralie, Barth, Dominique, Pidko, Evgeny A, Gaigeot, Marie-Pierre

    ISSN: 1463-9084, 1463-9084
    Vydáno: England 15.01.2025
    “…Some of our recent developments and applications of algorithmic graph theory for extracting the physical and chemical properties of materials from molecular dynamics simulations are presented…”
    Zjistit podrobnosti o přístupu
    Journal Article
  8. 8

    An algorithmic framework for the single source shortest path problem with applications to disk graphs Autor Klost, Katharina

    ISSN: 0925-7721
    Vydáno: Elsevier B.V 01.04.2023
    “…Shortest path problems are among the fundamental problems in graph theory. It is folklore that the unweighted single source shortest path (SSSP…”
    Získat plný text
    Journal Article
  9. 9

    Faster parameterized algorithms for minor containment Autor Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.

    ISSN: 0304-3975, 1879-2294
    Vydáno: Oxford Elsevier B.V 25.11.2011
    Vydáno v Theoretical computer science (25.11.2011)
    “… a cornerstone for most of the algorithmic applications of this theory. H - Minor containment for graphs of bounded branchwidth is a basic ingredient of this algorithm…”
    Získat plný text
    Journal Article
  10. 10
  11. 11

    Topological graphs: a review of some of our achievements and perspectives in physical chemistry and homogeneous catalysis Autor Bougueroua, Sana, Aboulfath, Ylène, Cimas, Alvaro, Hashemi, Ali,  Pidko, Evgeny A., Barth, Dominique, Gaigeot, Marie-Pierre

    ISSN: 1631-0748, 1878-1543
    Vydáno: Académie des sciences (Paris) 01.01.2025
    Vydáno v Comptes rendus. Chimie (01.01.2025)
    “…This paper reviews some of our developments in algorithmic graph theory, with some applications in physical chemistry and catalysis…”
    Získat plný text
    Journal Article
  12. 12

    Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem Autor Boros, Endre, Gurvich, Vladimir, Milanič, Martin, Uno, Yushi

    ISSN: 0364-9024, 1097-0118
    Vydáno: Hoboken Wiley Subscription Services, Inc 01.08.2025
    Vydáno v Journal of graph theory (01.08.2025)
    “… The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs…”
    Získat plný text
    Journal Article
  13. 13

    On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory Autor Langston, Michael A., Plaut, Barbara C.

    ISSN: 0012-365X, 1872-681X
    Vydáno: Elsevier B.V 01.03.1998
    Vydáno v Discrete mathematics (01.03.1998)
    “…A snapshot of our current exploration of the algorithmic aspects of the immersion order is presented…”
    Získat plný text
    Journal Article
  14. 14

    Applications of Community Detection Techniques to Brain Graphs: Algorithmic Considerations and Implications for Neural Function Autor Garcia, Javier O., Ashourvan, Arian, Muldoon, Sarah, Vettel, Jean M., Bassett, Danielle S.

    ISSN: 0018-9219, 1558-2256
    Vydáno: United States IEEE 01.05.2018
    Vydáno v Proceedings of the IEEE (01.05.2018)
    “…The human brain can be represented as a graph in which neural units such as cells or small volumes of tissue are heterogeneously connected to one another through structural or functional links…”
    Získat plný text
    Journal Article
  15. 15

    Graph classes with structured neighborhoods and algorithmic applications Autor Belmonte, Rémy, Vatshelle, Martin

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 04.11.2013
    Vydáno v Theoretical computer science (04.11.2013)
    “…Given a graph in any of the following graph classes: trapezoid graphs, circular permutation graphs, convex graphs, Dilworth k graphs, k-polygon graphs, circular…”
    Získat plný text
    Journal Article
  16. 16

    On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs Autor Munaro, Andrea, Yang, Shizhou

    ISSN: 0304-3975
    Vydáno: Elsevier B.V 26.04.2023
    Vydáno v Theoretical computer science (26.04.2023)
    “… While several NP-hard graph problems become tractable for graph classes whose mim-width is bounded and quickly computable, no algorithmic applications of boundedness of sim-width are known. In Kang et al. (2017) [32…”
    Získat plný text
    Journal Article
  17. 17

    An efficient approach towards the generation and analysis of interoperable clinical data in a knowledge graph Autor Dorpinghaus, Jens, Weil, Vera, Schaaf, Sebastian, Hubenthal, Tobias

    ISSN: 2300-5963
    Vydáno: Polish Information Processing Society 01.01.2021
    “…) a runtime analysis of 14 real- world use cases represented by graph queries and (3) a unique view on clinical data and its application, combining methods of algorithmic…”
    Získat plný text
    Konferenční příspěvek Journal Article
  18. 18
  19. 19

    An Introduction to Temporal Graphs: An Algorithmic Perspective Autor Michail, Othon

    ISSN: 1542-7951, 1944-9488
    Vydáno: Taylor & Francis 03.07.2016
    Vydáno v Internet mathematics (03.07.2016)
    “… ..., G l of static graphs over the same (static) set of nodes V. Though static graphs have been extensively studied, for their temporal generalization we are still far from having a concrete set of structural and algorithmic principles…”
    Získat plný text
    Journal Article
  20. 20

    Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications Autor Dusart, Jérémie, Habib, Michel, Corneil, Derek G.

    ISSN: 0167-8094, 1572-9273
    Vydáno: Dordrecht Springer Netherlands 01.04.2024
    Vydáno v Order (Dordrecht) (01.04.2024)
    “…A cocomparability graph is a graph whose complement admits a transitive orientation…”
    Získat plný text
    Journal Article