Výsledky vyhľadávania - "Weisfeiler-Leman algorithm"
-
1
Autori: Butti, Silvia
Prispievatelia: University/Department: Universitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions
Thesis Advisors: Dalmau, Víctor
Zdroj: TDX (Tesis Doctorals en Xarxa)
Predmety: Constraint satisfaction problems, Linear programming, Weisfeiler-Leman algorithm, Sherali-Adams hierarchy, Distributed algorithms, Model checking, Problema de satisfacción de restricciones, Programación lineal, Algoritmo de Weisfeiler-Leman, Jerarquía de Sherali-Adams, Algoritmos distribuidos, Verificación de modelos, Problema de satisfacció de restriccions, Programació lineal, Algoritme de Weisfeiler-Leman, Jerarquia de Sherali-Adams, Algorismes distribuïts, Verificació de models
Popis súboru: application/pdf
Prístupová URL adresa: http://hdl.handle.net/10803/675788
-
2
Autori:
Prispievatelia:
Zdroj: ACM Transactions on Computational Logic. 25:1-25
Predmety: Combinatorial Optimization, Weisfeiler-Leman Algorithm, Graph Isomorphism, Proof Complexity, Cutting Planes, 0102 computer and information sciences, ddc:004, Linear Programming, 0101 mathematics, 01 natural sciences
Popis súboru: application/pdf
Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.26
-
3
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 29th Annual European Symposium on Algorithms (ESA 2021)
Predmety: graph isomorphism, Weisfeiler-Leman algorithm, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, Mathematics of computing → Graphs and surfaces, Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Euler genus, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
Prístupová URL adresa: http://arxiv.org/abs/2106.14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/
https://publications.cispa.saarland/id/eprint/3458
https://doi.org/10.4230/LIPIcs.ESA.2021.72
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/pdf/LIPIcs-ESA-2021-72.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.72 -
4
Autori:
Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13 ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz 33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10 - 2025-02-14
Predmety: Mathematics of computing → Graph algorithms, Theory of computation → Complexity theory and logic, Theory of computation → Problems, reductions and completeness, Weisfeiler-Leman algorithm, coherent configurations, complexity, dimension
Geografické téma: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-362-1; info:eu-repo/grantAgreement/EC//101054974
-
5
Autori:
Zdroj: Grohe, M, Rattan, G & Seppelt, T 2025, 'Homomorphism Tensors and Linear Equations', Advances in Combinatorics. https://doi.org/10.19086/aic.2025.4
Predmety: Graph homomorphisms, Homomorphism indistinguishability, Labelled graphs, Treewidth, Pathwidth, Linear equations, Sherali–Adams relaxation, Specht–Wiegmann Theorem, Weisfeiler–Leman algorithm
-
6
Autori: Laurence Kluge
Zdroj: computational complexity. 33
Predmety: ddc:004, Weisfeiler-Leman algorithm, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Circulant graphs, 0102 computer and information sciences, Computational Complexity (cs.CC), 004 Informatik, 01 natural sciences, Cayley graphs, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Color refinement, 0101 mathematics, Schur modules, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
Prístupová URL adresa: http://arxiv.org/abs/2204.01054
-
7
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14Predmety: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Weisfeiler-Leman algorithm, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, ddc:004, Finite variable counting logics, Computational Complexity (cs.CC), Requantification, Logic in Computer Science (cs.LO)
Popis súboru: application/pdf
-
9
Autori:
Prispievatelia:
Predmety: homomorphism indistinguishability, tree-width, Weisfeiler-Leman algorithm, subgraph counts
Popis súboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.53
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: SIAM Journal on Discrete Mathematics. 35:1792-1853
Predmety: FOS: Computer and information sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), Cai-Fürer-Immerman Graphs, coherent Configurations, 01 natural sciences, Computer Science - Computational Complexity, Graph Isomorphism, Weisfeiler-Leman Algorithm, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), ddc:004, 0101 mathematics
Popis súboru: application/pdf
Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2020/11904/pdf/LIPIcs-STACS-2020-43.pdf
http://arxiv.org/abs/1907.02892
http://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#FuhlbruckKV20
https://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#FuhlbruckKV20
https://drops.dagstuhl.de/opus/volltexte/2020/11904/pdf/LIPIcs-STACS-2020-43.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/11904/
https://doi.org/10.4230/LIPIcs.STACS.2020.43
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-02892
http://arxiv-export-lb.library.cornell.edu/abs/1907.02892
https://epubs.siam.org/doi/pdf/10.1137/20M1327550
https://locus.siam.org/doi/abs/10.1137/20M1327550
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.43 -
11
Autori: Kluge, Laurence
Predmety: Weisfeiler-Leman algorithm, Color refinement, Circulant graphs, Cayley graphs, Schur modules, 004 Informatik, ddc:004
Popis súboru: application/pdf
Relation: https://doi.org/10.18452/31470
-
12
Autori:
Zdroj: Journal of Graph Theory. 99:278-311
Predmety: tally spectra, Weisfeiler-Leman algorithm, reconstruction conjecture, 05C60, colour refinement, FOS: Mathematics, Mathematics - Combinatorics, graph isomorphisms, Combinatorics (math.CO), 0102 computer and information sciences, Stockmeyer graphs, 0101 mathematics, 01 natural sciences
Prístupová URL adresa: http://arxiv.org/pdf/2008.01327
http://arxiv.org/abs/2008.01327
https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.22741
https://arxiv.org/pdf/2008.01327
https://arxiv.org/abs/2008.01327
https://ui.adsabs.harvard.edu/abs/2020arXiv200801327E/abstract
https://discovery-pp.ucl.ac.uk/id/eprint/10136455/ -
13
Autori: a ďalší
Zdroj: Journal of Machine Learning Research, 24
Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Machine learning for graphs, Graph neural networks, Weisfeiler-Leman algorithm, expressivity, equivariance, cs.LG, Machine Learning (stat.ML), 02 engineering and technology, 102019 Machine learning, 01 natural sciences, Machine Learning (cs.LG), 102031 Theoretische Informatik, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), cs.NE, Neural and Evolutionary Computing (cs.NE), 0105 earth and related environmental sciences, Computer Science - Neural and Evolutionary Computing, stat.ML, cs.DS, 102019 Machine Learning, 102031 Theoretical computer science
Popis súboru: application/pdf; application/application/pdf
Prístupová URL adresa: http://arxiv.org/abs/2112.09992
https://ucrisportal.univie.ac.at/de/publications/07379175-b414-48d5-964c-094e055524da
https://ucrisportal.univie.ac.at/de/publications/8e953d32-88a4-465b-aa81-1c1ff44fe692
https://phaidra.univie.ac.at/o:2071045
https://hdl.handle.net/11353/10.2071045
http://hdl.handle.net/20.500.11850/652505 -
14
Autori:
Prispievatelia:
Zdroj: Saarbrücken/Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 297, 78:[1]-78:20 (2024). doi:10.4230/LIPICS.ICALP.2024.78
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson51. International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, 2024-07-08-2024-07-12
Proceedings of the 51st International Colloquium on Automata, Languages, and ProgrammingPredmety: Weisfeiler-Leman algorithm, FOS: Computer and information sciences, twin width, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Finite Model Theory, tournament isomorphism, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
15
Autori:
Prispievatelia:
Predmety: FOS: Computer and information sciences, tree-width, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), FOS: Mathematics, Mathematics - Combinatorics, homomorphism indistinguishability, Combinatorics (math.CO), ddc:004, subgraph counts, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
16
Autori:
Prispievatelia:
Predmety: Cutting Planes, Proof Complexity, Linear Programming, Combinatorial Optimization, Weisfeiler-Leman Algorithm, Graph Isomorphism
Popis súboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.26
-
17
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Proceedings of the Annual ACM Symposium on Theory of Computing; pp 1371-1382 (2025) ; ISSN: 0737-8017
Predmety: Electrical Engineering, Electronic Engineering, Information Engineering, Cutting planes, Monotone circuit complexity, Proof complexity, Resolution, Supercritical trade-off, Weisfeiler-Leman algorithm
Relation: http://dx.doi.org/10.1145/3717823.3718271; scopus:105009775763
-
18
Autori: a ďalší
Zdroj: Journal of Machine Learning Research ; issn:1532-4435
Predmety: Machine learning for graphs, Graph neural networks, Weisfeiler-Leman algorithm, expressivity, equivariance
Popis súboru: application/pdf
Relation: hdl:11353/10.2071045; https://phaidra.univie.ac.at/o:2071045
Dostupnosť: https://phaidra.univie.ac.at/o:2071045
-
19
Autori:
Prispievatelia:
Predmety: constraint satisfaction problems, finite model theory, descriptive complexity, rank logic, Weisfeiler-Leman algorithm, cohomology
Popis súboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.75
-
20
Autori:
Prispievatelia:
Popis súboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.81
Full Text Finder 
Nájsť tento článok vo Web of Science