„Hypergraphs“

Suchergebnisse

1.000+ Treffer

• Certain types of intuitionistic fuzzy directed hypergraphs
  Myithili, K. K. ; Parvathi, R. ; Akram, M.
• Tight approximation bounds for vertex cover on dense k-partite hypergraphs
  Karpiński, Marek ; Schmied, Richard ; Viehmann, Claus 2011 Inst. für Informatik
• Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams
  Khanna, Sanjeev ; Putterman, Aaron ; Sudan, Madhu 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Cut-Vertex and the Interval Transit Functions of Hypergraphs
  Shanavas, Ameera Vaheeda ; Changat, Manoj ; Stadler, Peter F.
• The Multiple-Orientability Thresholds for Random Hypergraphs
  Fountoulakis, Nikolaos ; Khosla, Megha ; Panagiotou, Konstantinos 2016 Ludwig-Maximilians-Universität München
• Construction of d(H)-disjunct matrix for group testing in hypergraphs
  Gao, Hong ; Hwang, F. K. ; Thai, My T. ; Wu, Weili ; Znati, Taieb
• The Ground-Set-Cost Budgeted Maximum Coverage Problem
  van Heuven van Staereling, Irving ; Keijzer, Bart ˜deœ ; Schäfer, Guido 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear Realisability over Nets: Multiplicatives
  Ragot, Adrien ; Seiller, Thomas ; Tortora de Falco, Lorenzo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation
  Scheidt, Benjamin ; Schweikardt, Nicole 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A study of cluster hypergraphs and its properties
  Maity, Ananta ; Das, Kousik ; Samanta, Sovan ; Mondal, Sukumar ; Dubey, Vivek
• Perfect Matchings in Random Sparsifications of Dirac Hypergraphs
  Kang, Dong Yeap ; Kelly, Tom ; Kühn, Daniela ; Osthus, Deryk ; Pfenninger, Vincent
• Scarf’s Algorithm on Arborescence Hypergraphs
  Chandrasekaran, Karthekeyan ; Faenza, Yuri ; He, Chengyue ; Sethuraman, Jay 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Edge-connectivity in hypergraphs
  Zhao, Shuang ; Li, Dan ; Meng, Jixiang
• Splitting-Off in Hypergraphs
  Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás ; Kulkarni, Shubhang 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs
  Candela, Pablo ; Szegedy, Balázs ; Vena, Lluís
• Hypergraph Connectivity Augmentation in Strongly Polynomial Time
  Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás ; Kulkarni, Shubhang 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A novel rough set-based approach for minimum vertex cover of hypergraphs
  Zhou, Qian ; Xie, Xiaojun ; Dai, Hua ; Meng, Weizhi
• An algorithm to compute the strength of competing interactions in the Bering Sea based on pythagorean fuzzy hypergraphs
  Nawaz, Hafiza Saba ; Akram, Muhammad ; Alcantud, José Carlos R.
• An alternate proof of Szemerédi's cube Lemma using extremal hypergraphs
  Gunderson, David S. ; Rödl, Vojtěch 1995 Sonderforschungsbereich 343
• Spanning Spheres in Dirac Hypergraphs
  Illingworth, Freddie ; Lang, Richard ; Müyesser, Alp ; Parczyk, Olaf ; Sgueglia, Amedeo