„Graphs“

Suchergebnisse

10.000+ Treffer

• Mathieu Tillier and Naïm Vanthieghem, The Book of the Cow. An Early Qurʾānic Codex on Papyrus (P. Hamb. Arab. 68), Leiden: Brill, 2024, xv+198 pp., with two sets of manuscript images, 17 tables, 2 graphs, 7 figures, one appendix, bibliography, index, ISBN: 978-90-04-67739-5 (hardback).
  Fedeli, Alba
• Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs
  Mertzios, George B. ; Nikoletseas, Sotiris E. ; Raptopoulos, Christoforos ; Spirakis, Paul G. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple proof of the existence of restricted ramsey graphs by means of a partite construction
  Nešetřil, Jaroslav ; Rödl, Vojtěch
• Knowledge graphs - working group charter (NFDI section-metadata)
  Stocker, Markus ; Mehandzhiyska, Lozana Rossenova ; Shigapov, Renat ; Betancort, Noemi ; Dietze, Stefan ; Murphy, Bridget ; Bölling, Christian ; Schubotz, Moritz ; Koepler, Oliver 2023 Universitätsbibliothek Mannheim
• Bounds on the Voter Model in Dynamic Networks
  Berenbrink, Petra ; Giakkoupis, George ; Kermarrec, Anne-Marie ; Mallmann-Trenn, Frederik 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Giant Component of Geometric Inhomogeneous Random Graphs
  Bläsius, Thomas ; Friedrich, Tobias ; Katzmann, Maximilian ; Ruff, Janosch ; Zeif, Ziena 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M. 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice
  Simon, Bertrand ; Falk, Joachim ; Megow, Nicole ; Teich, Jürgen 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Möbius function for the set of acyclic directed backbone graphs
  Arrowsmith, David K. ; Essam, J. W.
• Composed Degree-Distance Realizations of Graphs
  Bar-Noy, Amotz ; Peleg, David ; Perry, Mor ; Rawitz, Dror
• Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
  Hanif, Muhammad Kashif ; Zimmermann, Karl-Heinz ; Anees, Asad
• Structural graph theory meets algorithms: covering and connectivity problems in graphs
  Akhoondian Amiri, Saeed ; Kreutzer, Stephan ; Pilipczuk, Marcin ; Thilikos, Dimitrios 2017 Technische Universität Berlin
• An Automated Flow to Map Throughput Constrained Applications to a MPSoC
  Jordans, Roel ; Siyoum, Firew ; Stuijk, Sander ; Kumar, Akash ; Corporaal, Henk 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantitative approach to Grover’s quantum walk on graphs
  Mograby, Gamal ; Balu, Radhakrishnan ; Okoudjou, Kasso A. ; Teplyaev, Alexander
• A web of loans: multilingual loanword lexicography with property graphs
  Meyer, Peter ; Eppinger, Mirjam ; Kosem, Iztok ; Zingano Kuhn, Tanara 2019 Leibniz-Institut für Deutsche Sprache (IDS), Bibliothek
• Correction to: Spatial legend compatibility within versus between graphs in multiple graph comprehension
  Riechelmann, Eva ; Huestegge, Lynn
• The theory of graphs and its applications – Claude Berge. 1962. Translated by Alison Doig. ix + 247 pp. New York: John Wiley & Sons, Inc., $6.50
  Rosen, Robert
• Algorithmic graph theory and perfect graphs – M. C. Golumbic: Academic Press, 1980, ISBN 0-12-289260-7
  Möhring, Rolf H.
• Book Review: Handbook of Graphs and Networks: From the Genome to the Internet; Editors Stefan Bornholdt and Heinz Georg Schuster, Wiley-VCH, Berlin 2003
  Hänggi, Peter 2003 Universität Augsburg
• Kirchhoff Graphs – Vector Dependencies and Implications
  Fehribach, Joseph D. 2026 De Gruyter