„sparse graphs“

Suchergebnisse

1.000+ Treffer

• Universally Composable Almost-Everywhere Secure Computation
  Chandran, Nishanth ; Forghani, Pouyan ; Garay, Juan ; Ostrovsky, Rafail ; Patel, Rutvik ; Zikas, Vassilis 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
  Wemheuer, Moritz ; Sturm, Anja ; Schuhmacher, Dominic 2023 Niedersächsische Staats- und Universitätsbibliothek Göttingen
• A parallel maximum clique algorithm for large and massive sparse graphs
  San Segundo, Pablo ; Lopez, Alvaro ; Artieda, Jorge ; Pardalos, Panos M.
• Blow-up Lemma for Cycles in Sparse Random Graphs
  Trujić, Miloš
• Efficient union find for planar graphs and other sparse graph classes – (extended abstracts)
  Gustedt, Jens 1995 TU, Fachbereich 3
• 2-Distance List $$(\varDelta +3)$$ ( Δ + 3 ) -Coloring of Sparse Graphs
  La, Hoang
• Efficient computation of implicit representations of sparse graphs
  Arikati, Srinivasa R. ; Maheshwari, Anil ; Zaroliagis, Christos 1995 MPI Informatik, Bibliothek & Dokumentation
• Random Walk Approaches to Clustering Directed Networks
  Rüdrich, Stefan 2020 Freie Universität Berlin
• Sparse Cuts and Algorithmic Problems
  Rauch, Johannes 2025 Universität Ulm
• Codes on Sparse Graphs for Satellite and Space Communications
  Matuz, Balázs 2013 Shaker
• Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs
  Hạ̀n, Hiêp ; Kang, Mihyun ; Taraz, Anusch ; Lefmann, Hanno 2011 Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II
• On injective edge coloring of sparse graphs with maximum degree 5
  Wu, Yanqing
• Sparse Critical Graphs for Defective (1, 3)-Coloring
  Kostochka, Alexandr ; Xu, Jingwei ; Zhu, Xuding
• Threshold phenomena in branching trees and sparse random graphs
  Voll, Ulrich
• Parameterized and Exact Computation – 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
  2010 Springer Berlin Heidelberg
• Parameterized and Exact Computation – First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings
  Raman, Venkatesh ; Saurabh, Saket 2004 Springer Berlin Heidelberg
• Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number
  Chudnovsky, Maria ; Czyżewska, Jadwiga ; Kluk, Kacper ; Pilipczuk, Marcin ; Rzążewski, Paweł 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Representing Edge Flows on Graphs via Sparse Cell Complexes
  Hoppe, Josef ; Schaub, Michael Thomas 2023 Universitätsbibliothek der RWTH Aachen
• Linear Orderings of Sparse Graphs
  Hanauer, Kathrin ; Brandenburg, Franz-Josef 2018 Universität Passau
• Resilience and anti-Ramsey properties of sparse random graphs and dense hypergraphs
  Schnitzer, Jakob ; Schacht, Mathias 2018 Staats- und Universitätsbibliothek Hamburg