„dynamic graphs“

Suchergebnisse

1.000+ Treffer

• Tracking local communities in streaming graphs with a dynamic algorithm
  Zakrzewska, Anita ; Bader, David A.
• Interval-valued fuzzy planar graphs
  Pramanik, Tarasankar ; Samanta, Sovan ; Pal, Madhumangal
• Representation of graphs based on neighborhoods and soft sets
  Ali, Muhammad Irfan ; Shābīr, Muḥammad ; Feng, Feng
• GraphBNC: Machine Learning‐Aided Prediction of Interactions Between Metal Nanoclusters and Blood Proteins (Adv. Mater. 47/2024)
  Pihlajamäki, Antti ; Matus, María Francisca ; Malola, Sami ; Häkkinen, Hannu
• When Do Graph Covers Preserve the Clique Dynamics of Infinite Graphs?
  Limbach, Anna Margarethe ; Winter, Martin
• Functional Graphs of Generalized Cyclotomic Mappings of Finite Fields
  Bors, Alexander ; Panario, Daniel ; Wang, Qiang 2025 EMS Press
• 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
• Modeling dynamic context for automation systems using semantically enriched property graphs
  Sahlab, Nada 2025 Shaker Verlag
• 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
• 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
• Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
  Füchsle, Eugen ; Molter, Hendrik ; Niedermeier, Rolf ; Renken, Malte 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multistage Vertex Cover
  Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Mining highly dynamic graphs
  Papadias, Serafeim ; Markl, Volker ; Kaoudi, Zoi ; Bonifati, Angela ; Hose, Katja 2024 Technische Universität Berlin
• Corrected Mean-Field Model for Random Sequential Adsorption on Random Geometric Graphs
  Dhara, Souvik ; Leeuwaarden, Johan S. H. ˜vanœ ; Mukherjee, Debankur
• From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
  Großmann, Ernestine ; Reinstädtler, Henrik ; Rotenberg, Eva ; Schulz, Christian ; van der Hoog, Ivor ; Vlieghe, Juliette 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Dynamic Data Structure for Split Completion
  Majewski, Konrad ; Pilipczuk, Michał ; Zych-Pawlewicz, Anna 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number
  Majewski, Konrad ; Pilipczuk, Michał ; Sokołowski, Marek 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Spectral Theory of Infinite Quantum Graphs
  Exner, Pavel ; Kostenko, Aleksey ; Malamud, Mark ; Neidhardt, Hagen
• Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures
  Dettmann, Carl P.
• Modeling Dynamic Context for Automation Systems Using Semantically Enriched Property Graphs
  Sahlab, Nada 2025 Shaker