„strongly connected components“

Suchergebnisse

19 Treffer

• Rough fuzzy strongly connected components of rough fuzzy directed graphs with applications to marine ecological networks
  Xu, Taihua ; Wang, Yuehui ; Song, Jingjing ; Cui, Yun ; Li, Shuai
• A Linear Time Algorithm for Quantum 2-SAT
  de Beaudrap, Niel ; Gharibian, Sevag 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Algorithms and Lower Bounds for Streaming Tournaments
  Ghosh, Prantar ; Kuchlous, Sahil 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Dynamic Strongly Connected Components in Planar Digraphs
  Karczmarz, Adam ; Smulewicz, Marcin 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Formal Proofs of Tarjan’s Strongly Connected Components Algorithm in Why3, Coq and Isabelle
  Chen, Ran ; Cohen, Cyril ; Lévy, Jean-Jacques ; Merz, Stephan ; Théry, Laurent 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A map-reduce algorithm to find strongly connected components of directed graphs
  Ji, Fujun ; Jin, Jidong
• A Typical Verification Challenge for the GRID
  van de Pol, Jaco
• On Fully Dynamic Strongly Connected Components
  Karczmarz, Adam ; Smulewicz, Marcin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Incremental SCC Maintenance in Sparse Graphs
  Bernstein, Aaron ; Dudeja, Aditi ; Pettie, Seth 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
  Georgiadis, Loukas ; Kosinas, Evangelos 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
  Baswana, Surender ; Choudhary, Keerti ; Roditty, Liam 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient parallel algorithm for finding strongly connected components based on granulation strategy
  Xu, Taihua ; He, Huixing ; Yang, Xibei ; Yang, Jie ; Song, Jingjing ; Cui, Yun
• Decomposition of a signed graph into strongly connected components and its signed poset structure
  Fujishige, Satoru ; Ando, Kazutoshi ; Nemoto, Toshio 1994 Forschungsinst. für Diskrete Mathematik
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
  Wijs, Anton ; Katoen, Joost-Pieter ; Bošnački, Dragan
• The strongly connected components of 1-in, 1-out
  Reed, Bruce A. ; McDiarmid, Colin 1991 Sonderforschungsbereich 303
• Strongly Connected Components can Predict Protein Structure
  Bolten, Eva ; Schliep, Alexander ; Schneckener, Sebastian ; Schomburg, Dietmar ; Schrader, Rainer 2001 Universitäts- und Stadtbibliothek Köln
• Strongly connected components based efficient computation of page rank
  Yang, Hongguo ; Shen, Derong ; Kou, Yue ; Nie, Tiezheng ; Yu, Ge
• An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
  Baswana, Surender ; Choudhary, Keerti ; Roditty, Liam
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
  Wijs, Anton ; Katoen, Joost-Pieter ; Bošnački, Dragan 2016 Universitätsbibliothek der RWTH Aachen