Výsledky vyhľadávania - "((\"graph algorithms in informatica\") OR (\"graph algorithms in informatik\"))*"

Force-Directed Immersive 3D Network Visualization.

Autori: Brezani, Alexander Kostolny, Jozef Zabovsky, Michal

Zdroj: Computers (2073-431X); Aug2024, Vol. 13 Issue 8, p189, 20p

Predmety: GRAPH algorithms, DATA structures, CAVES, ALGORITHMS, MATHEMATICS

Dynamic embeddings of dynamic single-source upward planar graphs

Autori: van der Hoog, Ivor Parada Muñoz, Irene María de Rotenberg, Eva a ďalší

Prispievatelia: van der Hoog, Ivor Parada Muñoz, Irene María de Rotenberg, Eva a ďalší

Predmety: Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Àrees temàtiques de la UPC::Informàtica, Graph theory, Computer science--Mathematics, Computing Methodologies, Dynamic graphs, Data structures, Computational geometry, Graph drawing, Graph algorithms, Upward planarity, Grafs, Teoria de, Informàtica--Matemàtica, Informàtica, Classificació AMS::05 Combinatorics::05C Graph theory, Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science, Classificació AMS::68 Computer science::68U Computing methodologies and applications

Popis súboru: application/pdf

Relation: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.70; info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES/; https://arxiv.org/abs/2209.14094; http://hdl.handle.net/2117/421904

Dostupnosť: http://hdl.handle.net/2117/421904
https://arxiv.org/abs/2209.14094
https://doi.org/10.4230/LIPIcs.ESA.2024.70

On the Complexity of String Matching for Graphs.

Autori: EQUI, MASSIMO MÄKINEN, VELI TOMESCU, ALEXANDRU I. a ďalší

Zdroj: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-25, 25p

Predmety: DIRECTED graphs, DIRECTED acyclic graphs, GRAPH algorithms, UNDIRECTED graphs, BOUND states, COMPUTATIONAL biology

Accelerating Computation of Steiner Trees on GPUs.

Autori: Muniasamy, Rajesh Pandian Nasre, Rupesh Narayanaswamy, N. S.

Zdroj: International Journal of Parallel Programming; Feb2022, Vol. 50 Issue 1, p152-185, 34p

Predmety: GRAPHICS processing units, DATA structures, GRAPH algorithms, APPROXIMATION algorithms, TREE graphs

Low diameter graph decompositions by approximate distance computation

Autori: Becker R. Emek Y. Lenzen C. a ďalší

Prispievatelia: Becker R. Emek Y. Lenzen C. a ďalší

Predmety: (semi-)streaming graph algorithm, Distributed graph algorithm, Graph decomposition, Metric tree embedding, Parallel graph algorithms, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020; volume:151; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029564

Dostupnosť: https://hdl.handle.net/10278/5029564
https://doi.org/10.4230/LIPIcs.ITCS.2020.50

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems

Autori: Bilò, Vittorio Caragiannis, Ioannis Fanelli, Angelo a ďalší

Prispievatelia: Bilò, Vittorio Caragiannis, Ioannis Fanelli, Angelo a ďalší

Zdroj: ISSN: 2192-5283 ; Dagstuhl Reports ; https://hal.archives-ouvertes.fr/hal-02089412 ; Dagstuhl Reports, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, 80 (125), pp.1-13. ⟨10.4230/LIPIcs.ICALP.2017.125⟩.

Predmety: arborescences, Steiner trees, shortest paths, matroids, multidimensional graph problems, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [INFO]Computer Science [cs]

Relation: hal-02089412; https://hal.archives-ouvertes.fr/hal-02089412; https://hal.archives-ouvertes.fr/hal-02089412/document; https://hal.archives-ouvertes.fr/hal-02089412/file/LIPIcs-ICALP-2017-125.pdf

Dostupnosť: https://hal.archives-ouvertes.fr/hal-02089412
https://hal.archives-ouvertes.fr/hal-02089412/document
https://hal.archives-ouvertes.fr/hal-02089412/file/LIPIcs-ICALP-2017-125.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2017.125

Using contracted solution graphs for solving reconfiguration problems

Autori: Paul Bonsma Daniël Paulusma Paul Bonsma and Daniël Paulusma a ďalší

Prispievatelia: Paul Bonsma Daniël Paulusma Paul Bonsma and Daniël Paulusma a ďalší

Zdroj: Faliszewski, P. & Muscholl, A. & Niedermeier, R. (Eds.). (2016). 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016, Kraków, Poland. Dagstuhl, Germany: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, pp. 20, LIPIcs : Leibniz international proceedings in informatics(58)

Predmety: dynamic programming, FOS: Computer and information sciences, Computer Science - Computational Complexity, reconfiguration, Computer Science - Data Structures and Algorithms, graph coloring, contraction, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC)

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2016/6435/pdf/LIPIcs-MFCS-2016-20.pdf
http://arxiv.org/abs/1509.06357
http://dro.dur.ac.uk/20026/
https://dro.dur.ac.uk/20026/
https://drops.dagstuhl.de/opus/volltexte/2016/6435/pdf/LIPIcs-MFCS-2016-20.pdf/
https://drops.dagstuhl.de/opus/volltexte/2016/6435/
https://doi.org/10.4230/LIPIcs.MFCS.2016.20
https://dblp.uni-trier.de/db/journals/corr/corr1509.html#BonsmaP15
https://dblp.uni-trier.de/db/journals/acta/acta56.html#BonsmaP19
https://link.springer.com/content/pdf/10.1007/s00236-019-00336-8.pdf
https://link.springer.com/article/10.1007%2Fs00236-019-00336-8
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.20
http://dro.dur.ac.uk/20026/
http://dro.dur.ac.uk/20026/1/20026.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2016.20
http://dro.dur.ac.uk/20026/2/20026.pdf

Dynamic embeddings of dynamic single-source upward planar graphs

Autori: Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. DCCG - Discrete, Combinational, and Computational Geometry van der Hoog, Ivor a ďalší

Témy: Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Àrees temàtiques de la UPC::Informàtica, Graph theory, Computer science--Mathematics, Computing Methodologies, Dynamic graphs, Data structures, Computational geometry, Graph drawing, Graph algorithms, Upward planarity, Grafs, Teoria de, Informàtica--Matemàtica, Informàtica, Classificació AMS::05 Combinatorics::05C Graph theory, Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science, Classificació AMS::68 Computer science::68U Computing methodologies and applications, Conference report

URL: https://arxiv.org/abs/2209.14094
https://hdl.handle.net/2117/421904
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.70
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.70
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES

A graph modification approach for finding core--periphery structures in protein interaction networks.

Autori: Bruckner, Sharon Hüffner, Falk Komusiewicz, Christian

Zdroj: Algorithms for Molecular Biology; 2015, Vol. 10 Issue 1, p1-13, 13p

Predmety: PROTEIN-protein interactions, NP-hard problems, GENE expression, CORE & periphery (Economic theory), HEURISTIC algorithms, LINEAR programming

Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications.

Autori: Fomin, Fedor V. Grandoni, Fabrizio Pyatkin, Artem V. a ďalší

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p9-9:17, 17p, 1 Chart

Predmety: GRAPH theory, COMBINATORICS, MATHEMATICAL analysis, COMPUTATIONAL mathematics, GRAPH algorithms, ALGORITHMS

Gems of Combinatorial Optimization and Graph Algorithms

Autori: Andreas S. Schulz Martin Skutella Sebastian Stiller a ďalší

Typ zdroja: eBook.

Predmet: Mathematics, Combinatorial optimization, Graph algorithms

Kategórie: BUSINESS & ECONOMICS / Operations Research, BUSINESS & ECONOMICS / Management Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Game Theory, MATHEMATICS / Geometry / Analytic, MATHEMATICS / Optimization

Algorithmic Foundations for Social Advancement

Autori: Shin-ichi Minato Takeaki Uno Norihito Yasuda a ďalší

Typ zdroja: eBook.

Predmet: Algorithms, Automatic differentiation

Kategórie: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms

Applied Graph Data Science : Graph Algorithms and Platforms, Knowledge Graphs, Neural Networks, and Applied Use Cases

Autori: Pethuru Raj Pushan Kumar Dutta Peter Han Joo Chong a ďalší

Typ zdroja: eBook.

Predmet: Graph theory, Graph theory--Data processing, Graphic methods--Data processing

Kategórie: COMPUTERS / Data Science / General

Combinatorial Algorithms

Autori: Sun-Yuan Hsieh Ling-Ju Hung Chia-Wei Lee

Typ zdroja: eBook.

Predmet: Computer science—Mathematics, Discrete mathematics, Computer engineering, Computer networks, Algorithms, Data structures (Computer science), Information theory, Computer graphics, Numerical analysis

Kategórie: COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Graphs and Algorithms in Communication Networks : Studies in Broadband, Optical, Wireless and Ad Hoc Networks

Autori: Arie Koster Xavier Muñoz

Typ zdroja: eBook.

Predmet: Computer networks, Graph algorithms

Kategórie: COMPUTERS / Hardware / General, BUSINESS & ECONOMICS / Management Science, BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Database Administration & Management, COMPUTERS / Networking / General, COMPUTERS / Programming / Algorithms, TECHNOLOGY & ENGINEERING / Telecommunications

Combinatorial Algorithms : 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings

Autori: Cristina Bazgan Henning Fernau

Typ zdroja: eBook.

Predmet: Computer science—Mathematics, Discrete mathematics, Computer engineering, Computer networks, Algorithms, Data structures (Computer science), Information theory, Computer graphics, Numerical analysis

Kategórie: COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Graph Algorithms And Applications 4

Autori: Giuseppe Liotta Roberto Tamassia Ioannis G Tollis

Typ zdroja: eBook.

Predmet: Graph theory, Graph algorithms

Kategórie: COMPUTERS / Computer Science

Graph Algorithms And Applications 5

Autori: Giuseppe Liotta Roberto Tamassia Ioannis G Tollis

Typ zdroja: eBook.

Predmet: Graph theory, Graph algorithms

Kategórie: COMPUTERS / Computer Science

Graph Algorithms And Applications 3

Autori: Giuseppe Liotta Roberto Tamassia Ioannis G Tollis

Typ zdroja: eBook.

Predmet: Graph theory, Graph algorithms

Kategórie: MATHEMATICS / Graphic Methods, COMPUTERS / Programming / Algorithms, COMPUTERS / Computer Engineering

Graph Algorithms And Applications 2

Autori: Giuseppe Liotta Roberto Tamassia Ioannis G Tollis

Typ zdroja: eBook.

Predmet: Graph algorithms

Kategórie: COMPUTERS / Computer Engineering, COMPUTERS / Programming / Algorithms, MATHEMATICS / Combinatorics