Three rings, one story? Reconstructing the Historical Connectivity of Religious Encounters within the OTRA Project (Ontology for the Transmission and Re-Use of Argumentative Patterns)

Συγγραφείς: Langeloh, Jacob

Συνεισφορές: Scholger, Walter, Vogeler, Georg, Tasovac, Toma, Baillot, Anne, Raunig, Elisabeth, Scholger, Martina, Steiner, Elisabeth, Centre for Information Modelling, Helling, Patrick

Πηγή: Digital Scholarship in the Humanities. 41:i165-i170

Θεματικοί όροι: Paper, History, middle ages, network analysis and graphs theory and application, islam, Theology and religious studies, FOS: Philosophy, ethics and religion, Philosophy, Short Presentation, semantic analysis, argumentation, database creation, Philology, ontology, christianity, and analysis, management, linked (open) data

Active and interactive learning strategies for error-tolerant graph matching

Συγγραφείς: Cortés Llosa, Xavier

Συνεισφορές: University/Department: Universitat Rovira i Virgili. Departament d'Enginyeria Informàtica i Matemàtiques

Thesis Advisors: Serratosa Casenelles, Francesc

Πηγή: TDX (Tesis Doctorals en Xarxa)

Θεματικοί όροι: Teoria de grafs, Aprenentatge automàtic, Reconoxeiment de patrons, Teoría de grafos, Aprendizaje automático, Reconocimiento de patrones, Graphs theory, Machine learning, Pattern recognition, Enginyeria i Arquitectura

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/10803/396314

Can machine translation of literary texts fool stylometry?

Συγγραφείς: Jan Rybicki

Συνεισφορές: Scholger, Walter, Vogeler, Georg, Tasovac, Toma, Baillot, Anne, Raunig, Elisabeth, Scholger, Martina, Steiner, Elisabeth, Centre for Information Modelling, Helling, Patrick

Πηγή: Digital Scholarship in the Humanities. 40:268-276

Θεματικοί όροι: Paper, attribution studies and stylometric analysis, Long Presentation, Literary studies, stylometry, human translation, network analysis, network analysis and graphs theory and application, machine translation, cluster analysis, Translation studies

Σύνδεσμος πρόσβασης: https://ruj.uj.edu.pl/handle/item/566191

Applying participatory design for developing an unplugged game to learning graph theory

Συγγραφείς: da Silva, Ana Paula^Aff1, Filho, Aluizio Haendchen^Aff1, Ferneda, Edilson^Aff2, do Prado, Hércules Antonio^{Aff2, IDs11423025105002_cor1}, Raabe, André Luís Alice^Aff1

Πηγή: Educational technology research and development: A bi-monthly publication of the Association for Educational Communications & Technology. 73(4):2645-2662

A New Metaphor-Free Metaheuristic Approach Based on Complex Networks and Bezier Curves

Συγγραφείς: Avila, K., Cuevas, E., Perez, M., Sarkar, R.

Πηγή: IEEE Access Access, IEEE. 11:104038-104069 2023

Shannon Capacity, Lovász Theta Number and the Mycielski Construction: Shannon capacity, Lovász theta number and the Mycielski construction

Συγγραφείς: Bence Csonka, Gábor Simonyi

Πηγή: IEEE Transactions on Information Theory. 70:7632-7646

Θεματικοί όροι: FOS: Computer and information sciences, QA166-QA166.245 Graphs theory / gráfelmélet, Shannon capacity of graphs, Information Theory (cs.IT), Applications of graph theory, 05C76, 94A24, 05C15, 05C50, FOS: Mathematics, Combinatorics (math.CO), Channel models (including quantum) in information and communication theory

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: https://zbmath.org/7973867
https://doi.org/10.1109/tit.2024.3394775

Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches

Συγγραφείς: Balázs Vass, Erika R. Bérczi-Kovács, Ádám Fraknói, Costin Raiciu, Gábor Rétvári

Πηγή: IEEE/ACM Transactions on Networking. 32:4519-4534

Θεματικοί όροι: QA166-QA166.245 Graphs theory / gráfelmélet, QA76.527 Network technologies / Internetworking / hálózati technológiák, hálózatosodás

Περιγραφή αρχείου: text

Cooperation in public goods games over uniform random hypergraphs with game transitions

Συγγραφείς: Wei, Nankun, Xiong, Xiaojin, Li, Qin, Feng, Minyu, Szolnoki, Attila

Θεματικοί όροι: QA166-QA166.245 Graphs theory / gráfelmélet

Περιγραφή αρχείου: text

Relation: https://real.mtak.hu/239527/1/rsif20251319.pdf; Wei, Nankun and Xiong, Xiaojin and Li, Qin and Feng, Minyu and Szolnoki, Attila (2026) Cooperation in public goods games over uniform random hypergraphs with game transitions. JOURNAL OF THE ROYAL SOCIETY INTERFACE, 23 (239). No. 20251319. ISSN 1742-5689

Διαθεσιμότητα: https://real.mtak.hu/239527/
https://real.mtak.hu/239527/1/rsif20251319.pdf
https://doi.org/10.1098/rsif.2025.1319

2-Reachable Subsets in Two-Colored Graphs

Συγγραφείς: Gyárfás, András, Sárközy, Gábor N.

Θεματικοί όροι: QA166-QA166.245 Graphs theory / gráfelmélet

Περιγραφή αρχείου: text

Relation: https://real.mtak.hu/237037/1/s00373-026-03036-6.pdf; Gyárfás, András and Sárközy, Gábor N. (2026) 2-Reachable Subsets in Two-Colored Graphs. GRAPHS AND COMBINATORICS, 42. ISSN 0911-0119

Διαθεσιμότητα: https://real.mtak.hu/237037/
https://doi.org/10.1007/s00373-026-03036-6

Disjointness graphs of short polygonal chains

Συγγραφείς: Pach, János, Tardos, Gábor, Tóth, Géza

Συνεισφορές: János Pach and Gábor Tardos and Géza Tóth, Goaoc, Xavier, Kerber, Michael

Πηγή: JCTB
38th International Symposium on Computational Geometry
Journal of Combinatorial Theory, Series B

Θεματικοί όροι: intersection graph, Ramsey theory, Generalized Ramsey theory, disjointness graph, QA166-QA166.245 Graphs theory / gráfelmélet, Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics of computing → Graph coloring, Mathematics - Combinatorics, \(\chi\)-bounded, Combinatorics (math.CO), coloring number, chi-bounded

Περιγραφή αρχείου: application/xml; application/pdf; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2112.05991
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.56

The Maximum Number of Cliques in Graphs with Bounded Odd Circumference: The maximum number of cliques in graphs with bounded odd circumference

Συγγραφείς: Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Chuanqi Xiao, Xiutao Zhu

Πηγή: Annals of Combinatorics. 28:1119-1125

Θεματικοί όροι: spectral radius, Extremal problems in graph theory, QA166-QA166.245 Graphs theory / gráfelmélet, Graphs and linear algebra (matrices, eigenvalues, etc.), Ramsey theory, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Enumeration in graph theory, 01 natural sciences, Turán problem

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.01989

Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions: Shortest odd paths in undirected graphs with conservative weight functions

Συγγραφείς: Alpár Jüttner, Csaba Király 0001, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi 0001

Πηγή: Discrete Applied Mathematics. 357:34-50

Θεματικοί όροι: FOS: Computer and information sciences, Extremal problems in graph theory, fixed-parameter algorithms, Distance in graphs, monadic second-order logic, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, parity constrained odd path, 01 natural sciences, Signed and weighted graphs, QA166-QA166.245 Graphs theory / gráfelmélet, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, treewidth, FOS: Mathematics, shortest odd path, Data Structures and Algorithms (cs.DS), Higher-order logic, Paths and cycles, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml; application/pdf; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.12653
http://hdl.handle.net/10831/113182

On Turán problems with bounded matching number

Συγγραφείς: Gerbner, Dániel

Πηγή: Journal of Graph Theory. 106:23-29

Θεματικοί όροι: Extremal problems in graph theory, QA166-QA166.245 Graphs theory / gráfelmélet, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching, FOS: Mathematics, Turán number, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, Enumeration in graph theory, 01 natural sciences

Περιγραφή αρχείου: application/xml; text

Állomásközök és térközök hatása a vasúthálózat modelljének pontosságára

Συγγραφείς: Bence Tóth

Πηγή: Hadtudomány. 33:137-156

Θεματικοί όροι: TF Railroad engineering and operation / vasútépítés és üzemeltetés, QA166-QA166.245 Graphs theory / gráfelmélet, U1 Military Science (General) / hadtudomány általában

Περιγραφή αρχείου: text

Monochromatic spanning trees and matchings in ordered complete graphs

Συγγραφείς: János Barát, András Gyárfás, Géza Tóth 0001

Πηγή: J. Graph Theory

Θεματικοί όροι: spanning tree, matching, ordered graph, Ramsey theory, Generalized Ramsey theory, 0102 computer and information sciences, geometric Ramsey, 01 natural sciences, Trees, QA166-QA166.245 Graphs theory / gráfelmélet, Coloring of graphs and hypergraphs, monochromatic, nested edges, FOS: Mathematics, Mathematics - Combinatorics, twisted drawing, Combinatorics (math.CO), 0101 mathematics, crossing edges

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2210.10135

A full characterization of invariant embeddability of unimodular planar graphs

Συγγραφείς: Ádám Timár, László Márton Tóth

Πηγή: Random Structures & Algorithms. 64:320-353

Θεματικοί όροι: Probability (math.PR), Random graphs (graph-theoretic aspects), excluded minors, Graph minors, 60D05, 60K99, 05C10, 0102 computer and information sciences, unimodular random maps, 01 natural sciences, Planar graphs, geometric and topological aspects of graph theory, QA166-QA166.245 Graphs theory / gráfelmélet, invariant planar embedding, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), FOS: Mathematics, Geometric probability and stochastic geometry, locally finite embedding, 0101 mathematics, Probability

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2101.12709
https://arxiv.org/abs/2101.12709

Kapcsolatok hálójában: gráfelmélet a társadalmi hálózatok szolgálatában

Συγγραφείς: Kátai, Zoltán

Θεματικοί όροι: HM Sociology / társadalomkutatás, QA166-QA166.245 Graphs theory / gráfelmélet

Περιγραφή αρχείου: text

Relation: https://real.mtak.hu/230818/1/2025KataiZoltanKapcsolatokHalojaban%20REAL.pdf; Kátai, Zoltán (2025) Kapcsolatok hálójában: gráfelmélet a társadalmi hálózatok szolgálatában. Sapientia Tankönyv . Scientia, Kolozsvár. ISBN 978-606-975-107-7

Διαθεσιμότητα: https://real.mtak.hu/230818/
https://real.mtak.hu/230818/1/2025KataiZoltanKapcsolatokHalojaban%20REAL.pdf
https://doi.org/10.47745/SAPVOL.2025.05

Turán problems for edge-ordered graphs

Συγγραφείς: Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer

Πηγή: Journal of Combinatorial Theory, Series B

Θεματικοί όροι: QA Mathematics / matematika, edge ordered graphs, discrete geometry, Ordered sets, 0102 computer and information sciences, Enumeration in graph theory, 01 natural sciences, QA166-QA166.245 Graphs theory / gráfelmélet, forbidden submatrices, FOS: Mathematics, extremal combinatorics, Erdős-Stone-Simonovits theorem, Combinatorics (math.CO), 0101 mathematics, Turán theorem, Combinatorial aspects of matrices (incidence, Hadamard, etc.)

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: https://zbmath.org/7667216
https://doi.org/10.1016/j.jctb.2022.12.006

Approximating Minimum Representations of Key Horn Functions: Approximating minimum representations of key Horn functions

Συγγραφείς: Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino

Πηγή: SIAM Journal on Computing. 51:116-138

Θεματικοί όροι: FOS: Computer and information sciences, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Analysis of algorithms and problem complexity, Database theory, Databases (cs.DB), implicational systems, 0102 computer and information sciences, 02 engineering and technology, Hypergraphs, directed hypergraphs, 01 natural sciences, Approximation algorithms, Classical propositional logic, Horn minimization, QA166-QA166.245 Graphs theory / gráfelmélet, Computer Science - Databases, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Boolean functions, approximation algorithms

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1811.05160
http://arxiv.org/abs/1811.05160
https://zbmath.org/7488097
https://doi.org/10.1137/19m1275681
http://isaim2020.cs.ou.edu/papers/ISAIM2020_Boolean_Berczi_etal.pdf

B2-EPG Split

Συγγραφείς: Luis Fernando Dos Santos Marinho, Kedson Alves Silva, Tanilson Dias dos Santos

Πηγή: Academic Journal on Computing, Engineering and Applied Mathematics; Vol. 4 No. 1 (2023); 1-7
Academic Journal on Computing, Engineering and Applied Mathematics; v. 4 n. 1 (2023); 1-7

Θεματικοί όροι: Grafos Split, Graphs Theory, Split Graphs, EPG Representation, B2-EPG, Intersection Graphs, Representação EPG, Teoria dos Grafos, Grafos de Interseção

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://sistemas.uft.edu.br/periodicos/index.php/AJCEAM/article/view/15143