„Graphs“

Suchergebnisse

10.000+ Treffer

• Modeling dynamic context for automation systems using semantically enriched property graphs
  Sahlab, Nada 2025 Shaker Verlag
• Martin Boundary of Killed Random Walks on Isoradial Graphs
  Boutillier, Cédric ; Raschel, Kilian
• Genus polynomials of ladder-like sequences of graphs
  Chen, Yichao ; Gross, Jonathan L. ; Mansour, Toufik ; Tucker, Thomas W.
• Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs
  Chizmar, Emily ; Magnant, Colton ; Salehi Nowbandegani, Pouria
• A parallel maximum clique algorithm for large and massive sparse graphs
  San Segundo, Pablo ; Lopez, Alvaro ; Artieda, Jorge ; Pardalos, Panos M.
• L. Rosenhead, W. G. Bichley, C. W. Jones, L. F. Nichelson, H. H. Pearcey, C. K. Thornhill, B. C. Tomlinson, A Selection of Graphs for Use in Calculations of Compressible Airflow. X + 115 S. m. zahlr. Kurventafeln. Oxford 1954. Clarendon Press. Preis geb. 84 s
  Krienes, K.
• RUTH PATRICK und CH. W. REIMER: The diatoms of the United States. Vol. I. Mono graphs of the Academy of Natural Sciences of Philadelphia, 13, xi + 688 pp., 64 Taf., Philadelphia, 1966, U.S. $6 18,50
  Simonsen, R.
• Fiedler, M. (ed.): Theory of Graphs and its Applications, Proceedings of the Symposium held in Smolenice in June 1963. Publishing House of the Czechoslovak Academy of Sciences, Prag 1964. 234 S., Preis Kč 26,50
  Fels, E. M.
• Theory of Graphs. (Proceedings of the Colloquium Held at Tihany, Hungary, September 1966). 370 S. m. Fig. Budapest/New York 1968. Akedémiaí Kiadó/Academic Press. Preis geb. $ 11.00
  Sachs, H.
• A. Adám, Truth Functions and the Problem of their Realization by Two‐Terminal Graphs. 206 S. m. 34 Fig. Budapest 1968. Akadémiai Kiadó
  Kaiser, E.
• Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth
  Fürer, Martin ; Hoppen, Carlos ; Trevisan, Vilmar 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Planar Stories of Graph Drawings: Algorithms and Experiments
  Binucci, Carla ; Cornelsen, Sabine ; Didimo, Walter ; Hong, Seok-Hee ; Katsanou, Eleni ; Patrignani, Maurizio ; Symvonis, Antonios ; Wolf, Samuel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Price of Connectivity Augmentation on Planar Graphs
  A. Akitaya, Hugo ; Dallant, Justin ; Demaine, Erik D. ; Kaufmann, Michael ; Kleist, Linda ; Stock, Frederick ; Tóth, Csaba D. ; Ueckerdt, Torsten 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs
  Galby, Esther ; Lima, Paloma T. ; Munaro, Andrea ; Nikabadi, Amir 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• How Does Knowledge Evolve in Open Knowledge Graphs?
  Polleres, Axel ; Pernisch, Romana ; Bonifati, Angela ; Dell'Aglio, Daniele ; Dobriy, Daniil ; Dumbrava, Stefania ; Etcheverry, Lorena ; Ferranti, Nicolas ; Hose, Katja ; Jiménez-Ruiz, Ernesto ; Lissandrini, Matteo ; Scherp, Ansgar ; Tommasini, Riccardo ; Wachs, Johannes
• Large Language Models and Knowledge Graphs: Opportunities and Challenges
  Pan, Jeff Z. ; Razniewski, Simon ; Kalo, Jan-Christoph ; Singhania, Sneha ; Chen, Jiaoyan ; Dietze, Stefan ; Jabeen, Hajira ; Omeliyanenko, Janna ; Zhang, Wen ; Lissandrini, Matteo ; Biswas, Russa ; Melo, Gerard ˜deœ ; Bonifati, Angela ; Vakaj, Edlira ; Dragoni, Mauro ; Graux, Damien
• Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs
  Brunner, Josh ; Demaine, Erik D. ; Diomidova, Jenny ; Gomez, Timothy ; Hecher, Markus ; Stock, Frederick ; Zhou, Zixiang 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
  Brunner, Josh ; Chung, Lily ; Demaine, Erik D. ; Hendrickson, Della ; Tockman, Andy 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Wheeler Graphs and Wheeler Languages
  Cotumaccio, Nicola ; D'Agostino, Giovanna ; Gibney, Daniel ; Policriti, Alberto ; Prezza, Nicola ; Thankachan, Sharma V. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Yeo’s Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic
  Di Guardia, Rémi ; Laurent, Olivier ; Tortora de Falco, Lorenzo ; Vaux Auclair, Lionel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik