„Graph computing“

Suchergebnisse

2.363 Treffer

• Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
  Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter ; Lima, Paloma T. ; Paulusma, Daniël
• Strong Articulation Points and Strong Bridges in Large Scale Graphs
  Firmani, Donatella ; Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi ; Santaroni, Federico
• Connectivity of directed fuzzy incidence graphs applied to traffic networks
  Gayathri, G. ; Mathew, Sunil C. ; Mordeson, J. N.
• When Can Graph Hyperbolicity be Computed in Linear Time?
  Fluschnik, Till ; Komusiewicz, Christian ; Mertzios, George B. ; Nichterlein, André ; Niedermeier, Rolf ; Talmon, Nimrod
• Spanning Trees in Multipartite Geometric Graphs
  Biniaz, Ahmad ; Bose, Prosenjit ; Eppstein, David ; Maheshwari, Anil ; Morin, Pat ; Smid, Michiel
• Computing subset vertex covers in H-free graphs
  Brettell, Nick ; Oostveen, Jelle J. ; Pandey, Sukanya ; Paulusma, Daniel ; Rauch, Johannes ; van Leeuwen, Erik Jan 2025 Universitätsbibliothek der RWTH Aachen
• Dimerized decomposition of quantum evolution on an arbitrary graph
  Feng, He ; Yan, Tian-Min ; Jiang, Yuhai
• Efficient robust secret sharing from expander graphs
  Falk, Brett Hemenway ; Ostrovsky, Rafail
• Minimal codewords over finite fields derived from certain graphs
  Kim, Boran
• The Topology of Local Computing in Networks
  Fraigniaud, Pierre ; Paz, Ami 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Novel group decision making approach based on the rough soft approximations of graphs and hypergraphs
  Sarwar, Musavarah ; Zafar, Fariha ; Akram, Muhammad
• Component Order Connectivity in Directed Graphs
  Bang-Jensen, Jørgen ; Eiben, Eduard ; Gutin, Gregory Z. ; Wahlström, Magnus ; Yeo, Anders
• (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Cao, Yixin ; Ke, Yuping ; Pierron, Théo
• Computing median and antimedian sets in median graphs
  Balakrishnan, Kannan ; Brešar, Boštjan ; Changat, Manoj ; Klavžar, Sandi ; Kovše, Matjaž ; Subhamathi, Ajitha R.
• Binary Search in Graphs Revisited
  Deligkas, Argyrios ; Mertzios, George B. ; Spirakis, Paul G.
• Computing β-Stretch Paths in Drawings of Graphs
  Arkin, Esther M. ; Sahneh, Faryad Darabi ; Efrat, Alon ; Frank, Fabian ; Fulek, Radoslav ; Kobourov, Stephen ; Mitchell, Joseph S. B. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing
  Berenbrink, Petra ; Friedetzky, Thomas ; Kling, Peter ; Mallmann-Trenn, Frederik ; Wastell, Chris 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
  Xiao, Mingyu ; Huang, Sen ; Chen, Xiaoyu
• Inserting an Edge into a Planar Graph
  Gutwenger, Carsten ; Mutzel, Petra ; Weiskircher, René
• Defense against membership inference attack in graph neural networks through graph perturbation
  Wang, Kai ; Wu, Jinxia ; Zhu, Tianqing ; Ren, Wei ; Hong, Ying