Search Results - 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory~

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

Authors: Kanté, Mamadou Moustapha Kim, Eun Jung Kwon, O-Joung et al.

Contributors: Kanté, Mamadou Moustapha Kim, Eun Jung Kwon, O-Joung et al.

Source: Journal of Combinatorial Theory, Series B. 160:15-35

Subject Terms: Linear rank-width, path-width, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 0102 computer and information sciences, 01 natural sciences, Graph, forbidden minor, FOS: Mathematics, Vertex-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, pivot-minor, Matroid, linear rank-width, Pivot-minor, graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Path-width, Combinatorics, vertex-minor, Forbidden minor, matroid, Combinatorics (math.CO), ddc:004, Recherche opérationnelle, 05B35 (Primary), 05C75 (Secondary)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2109.12291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.40
https://hal.science/hal-04056695v1
https://doi.org/10.1016/j.jctb.2022.12.004
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2
https://doi.org/10.4230/lipics.stacs.2022.40

Brief Announcement : The Shortest Temporal Exploration Problem

Authors: Balev, Stefan Sanlaville, Éric Toullalan, Antoine et al.

Contributors: Balev, Stefan Sanlaville, Éric Toullalan, Antoine et al.

Source: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND) ; https://normandie-univ.hal.science/hal-05283832 ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND), Jun 2025, LIVERPOOL, United Kingdom. ⟨10.4230/LIPIcs.SAND.2025.2⟩

Subject Terms: Mathematics of computing → Graph theory, Temporal Graph Exploration, Graph Theory, Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory Temporal Graph Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Subject Geographic: LIVERPOOL, United Kingdom

Availability: https://normandie-univ.hal.science/hal-05283832
https://normandie-univ.hal.science/hal-05283832v1/document
https://normandie-univ.hal.science/hal-05283832v1/file/LIPIcs.SAND.2025.18.pdf
https://doi.org/10.4230/LIPIcs.SAND.2025.2

The Shortest Temporal Exploration Problem

Authors: Balev, Stefan Sanlaville, Eric Toullalan, Antoine et al.

Contributors: Balev, Stefan Sanlaville, Eric Toullalan, Antoine et al.

Source: https://normandie-univ.hal.science/hal-05020820 ; LITIS, Le Havre Normandie University. 2025.

Subject Terms: Temporal graph, Graph exploration, Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration Graph Theory Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Availability: https://normandie-univ.hal.science/hal-05020820
https://normandie-univ.hal.science/hal-05020820v1/document
https://normandie-univ.hal.science/hal-05020820v1/file/STEXP_Balev_Sanlaville_Toullalan.pdf
https://doi.org/10.4230/LIPIcs

An Algorithmic Framework for Locally Constrained Homomorphisms

Authors: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen et al.

Contributors: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen et al.

Source: Lecture Notes in Computer Science ISBN: 9783031159138
Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 114-128, Lecture Notes in Computer Science, Vol.13453

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), fracture number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, (locally constrained) graph homomorphism parameterized complexity fracture number, integer linear programming, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), parameterized complexity, role assignment, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism, deletion set/modulator to small components, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism parameterized complexity deletion set/modulator to small components role assignment integer linear programming, Computer Science - Computational Complexity, Combinatorics (math.CO), Recherche opérationnelle, (locally constrained) graph homomorphism, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2201.11731
https://hal.science/hal-04495171v1
https://doi.org/10.1007/978-3-031-15914-5_9
https://hal.science/hal-04495171v1/document
http://dro.dur.ac.uk/37188/
http://dro.dur.ac.uk/37188/1/37188.pdf
https://doi.org/10.1007/978-3-031-15914-5_9

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k

Authors: Kim, Eun, Jung Kwon, O-Joung Oum, Sang-Il et al.

Contributors: Kim, Eun, Jung Kwon, O-Joung Oum, Sang-Il et al.

Source: STACS 2022 ; https://hal.science/hal-04056545 ; STACS 2022, Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.40⟩

Subject Terms: 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, matroid, linear rank-width, graph, forbidden minor, vertex-minor, pivot-minor, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Subject Geographic: Marseille, France

Availability: https://hal.science/hal-04056545
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2/file/LIPIcs-STACS-2022-40.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.40

Application of Graph-Theoretic Methods Using ERP Components and Wavelet Coherence on Emotional and Cognitive EEG Data.

Authors: Deniz, Sencer Melih Ademoglu, Ahmet Duru, Adil Deniz et al.

Source: Brain Sciences (2076-3425); Jul2025, Vol. 15 Issue 7, p714, 24p

Subject Terms: EMOTIONS, COGNITION, WAVELETS (Mathematics), ELECTROENCEPHALOGRAPHY, SUPERVISED learning, EVOKED potentials (Electrophysiology), ELECTROPHYSIOLOGY, GRAPH theory

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree

Authors: Equi, Massimo Grossi, Roberto Makinen, Veli et al.

Contributors: Equi, Massimo Grossi, Roberto Makinen, Veli et al.

Subject Terms: 0301 basic medicine, FOS: Computer and information sciences, J.3, string matching, F.1, E.1, F.2.2, G.2.2, H.2.3, H.2.8, H.3.3, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, heterogeneous networks, 2012 ACM Subject Classification Mathematics of computing → Graph algorithms Theory of computation → Problems, 03 medical and health sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), strong exponential time hypothesis, graph search, variation graphs, labeled graphs, exact pattern matching, Computer Science - Computational Complexity, string search, graph query

File Description: application/pdf

Access URL: http://arxiv.org/abs/1901.05264
https://inria.hal.science/hal-02338498v1

Optimality of Geometric Local Search

Authors: Jartoux, Bruno Mustafa, Nabil Laboratoire d'Informatique Gaspard-Monge (LIGM) et al.

Contributors: Jartoux, Bruno Mustafa, Nabil Laboratoire d'Informatique Gaspard-Monge (LIGM) et al.

Source: 34th International Symposium on Computational Geometry (SoCG 2018)
https://hal.science/hal-01797822
34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩

Subject Terms: Hall's marriage theorem, matchings, expansion, local search, 2012 ACM Subject Classification Theory of computation ! Approximation algorithms analysis, Mathematics of computing ! Combinatorial optimization, Mathematics of computing ! Graph theory, Mathematics of computing ! Approximation algorithms, [SCCO.COMP]Cognitive science/Computer science, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Subject Geographic: Budapest, Hungary

Availability: https://hal.science/hal-01797822
https://hal.science/hal-01797822v1/document
https://hal.science/hal-01797822v1/file/p48-jartoux.pdf
https://doi.org/10.4230/LIPIcs.SoCG.2018.48

Application of Artificial Intelligence Technologies as an Intervention for Promoting Healthy Eating and Nutrition in Older Adults: A Systematic Literature Review.

Authors: Kalu, Kingsley Ataguba, Grace Onifade, Oyepeju et al.

Source: Nutrients. Oct2025, Vol. 17 Issue 20, p3223. 33p.

Brain analysis to approach human muscles synergy using deep learning.

Authors: Samadi, Elham Rahatabad, Fereidoun Nowshiravan Nasrabadi, Ali Motie et al.

Source: Cognitive Neurodynamics; 2/22/2025, Vol. 19 Issue 1, p1-17, 17p

Enumerative Combinatorics.

Source: Oberwolfach Reports; 2022, Vol. 19 Issue 4, p3215-3305, 89p

Subject Terms: GRAPH theory, STATISTICAL physics, PROBABILITY theory, COMPUTER science, COMBINATORICS, ENUMERATIVE combinatorics

THE DISCRETE YET UBIQUITOUS THEOREMS OF CARATHÚEODORY, HELLY, SPERNER, TUCKER, AND TVERBERG.

Authors: DE LOERA, JESÚUS A. GOAOC, XAVIER MEUNIER, FRÚEDÚERIC et al.

Source: Bulletin (New Series) of the American Mathematical Society; Jul2019, Vol. 56 Issue 3, p415-511, 97p

Subject Terms: GRAPH theory, COMBINATORIAL geometry, MATHEMATICAL optimization, COMPUTATIONAL geometry, COMPUTATIONAL mathematics

Integrating Fuzzy Graph Theory into Cryptography: A Survey of Techniques and Security Applications.

Authors: Singh, Rashmi Khalid, Saifullah Nishad, D. K. et al.

Source: New Mathematics & Natural Computation; Mar2026, Vol. 22 Issue 1, p271-290, 20p

Subject Terms: FUZZY graphs, CRYPTOGRAPHY, IMAGE encryption, SECURITY management, ACCESS control

Efficient polynomial-time approximation scheme for the genus of dense graphs.

Authors: Jing, Yifan Mohar, Bojan

Source: Journal of the ACM; Dec2024, Vol. 71 Issue 6, p1-33, 33p

Subject Terms: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

Probabilistic Dimensionality Reduction via Structure Learning.

Authors: Wang, Li Mao, Qi

Source: IEEE Transactions on Pattern Analysis & Machine Intelligence; Jan2019, Vol. 41 Issue 1, p205-219, 15p

Subject Terms: DIMENSION reduction (Statistics), DATA analysis, LEARNING problems, MATRICES (Mathematics), GRAPH theory

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index.

Authors: Bernshteyn, Anton Weilacher, Felix

Source: Transactions of the American Mathematical Society; Nov2025, Vol. 378 Issue 11, p8183-8221, 39p

Subject Terms: DISTRIBUTED algorithms, COMBINATORICS, MONTE Carlo method, GRAPH theory, BOREL sets

Enumerating Minimal Solution Sets for Metric Graph Problems.

Authors: Bergougnoux, Benjamin Defrain, Oscar Mc Inerney, Fionn

Source: Algorithmica; May2025, Vol. 87 Issue 5, p712-735, 24p

Subject Terms: GRAPH theory, MATROIDS, MATHEMATICS, TRANSVERSAL lines, POLYNOMIALS

A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs.

Authors: Takaaki Fujita Smarandache, Florentin

Source: Neutrosophic Systems with Applications; 2025, Vol. 25 Issue 2, p39-79, 41p

Subject Terms: GRAPH theory, NEUTROSOPHIC logic, FUZZY logic, FUZZY graphs, GRAPHIC methods

A Zykov algebra approach to clique propagation: Classifying clique complexes in graphs.

Authors: Bustamante, Alfonso Umbrey, Gete Moyong, Botem et al.

Source: Discrete Mathematics, Algorithms & Applications; Aug2025, Vol. 17 Issue 6, p1-32, 32p

Subject Terms: GRAPH theory, SUBGRAPHS, STRUCTURAL analysis (Engineering), COMPUTER science, DIAGNOSTIC imaging

Collaboration of random walks on graphs.

Authors: Dey, Partha S. Kim, Daesung Terlov, Grigory

Source: Proceedings of the American Mathematical Society; Nov2025, Vol. 153 Issue 11, p4961-4974, 14p

Subject Terms: RANDOM walks, GRAPH theory, GEOMETRIC vertices, RESEARCH questions