Search Results - Combinatorial Graph theory Graph algorithms. msc*

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity.

Authors: Balabán, Jakub Ganian, Robert Rocton, Mathis

Source: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 4, p2102-2141, 40p

Subject Terms: GRAPH theory, GRAPH algorithms

Extension of universal cycles for globally identifying colorings of cycles

Authors: Pierre Coupechoux Coupechoux, Pierre Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC) et al.

Contributors: Pierre Coupechoux Coupechoux, Pierre Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC) et al.

Source: Discrete Mathematics. 340:1456-1466

Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, Universal Cycles 2010 MSC: 05C15, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms, 01 natural sciences, 05C38, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Identifying coloring, Identifying codes, Graph Theory, Cycles, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs]

File Description: application/pdf

Access URL: https://www.sciencedirect.com/science/article/pii/S0012365X17300390
https://hal.laas.fr/hal-01704385/document
https://hal.laas.fr/hal-01704385
http://dblp.uni-trier.de/db/journals/dm/dm340.html#Coupechoux17
https://dblp.uni-trier.de/db/journals/dm/dm340.html#Coupechoux17

REACHABILITY PRESERVERS: NEW EXTREMAL BOUNDS AND APPROXIMATION ALGORITHMS.

Authors: ABBOUD, AMIR BODWIN, GREG

Source: SIAM Journal on Computing; 2024, Vol. 53 Issue 2, p221-246, 26p

Subject Terms: APPROXIMATION algorithms, STEINER systems, DIRECTED graphs, GRAPH algorithms, GRAPH theory, WORK design, OSMOSIS

Geographic Terms: PHILADELPHIA (Pa.), THAILAND

ANALYZING THE INFLUENCE OF AGENTS IN TRUST NETWORKS: APPLYING NONSMOOTH EIGENSENSITIVITY THEORY TO A GRAPH CENTRALITY PROBLEM.

Authors: DONNELLY, JON STECHLINSKI, PETER

Source: SIAM Journal on Matrix Analysis & Applications; 2023, Vol. 44 Issue 3, p1271-1298, 28p

Subject Terms: GRAPH theory, TRUST, MALWARE, NONSMOOTH optimization, SET theory, GRAPH algorithms, REPUTATION

HAMILTONIAN CYCLE PARAMETERIZED BY TREEDEPTH IN SINGLE EXPONENTIAL TIME AND POLYNOMIAL SPACE.

Authors: NEDERLOF, JESPER PILIPCZUK, MICHAŁ SWENNENHUIS, CELINE M. F. et al.

Source: SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 3, p1566-1586, 21p

Subject Terms: POLYNOMIAL time algorithms, TIME complexity, DYNAMIC programming, ALGORITHMS, GRAPH algorithms, POLYNOMIALS, HAMILTONIAN graph theory

Online, Computable and Punctual Structure Theory.

Authors: Askes, Matthew Downey, Rod

Source: Logic Journal of the IGPL. Dec2023, Vol. 31 Issue 6, p1251-1293. 43p.

Subject Terms: COMPUTABLE functions, STRUCTURAL analysis (Engineering), GRAPH algorithms, STRUCTURAL frames, ONLINE algorithms

Combinatorial-topological framework for the analysis of global dynamics.

Authors: Bush, Justin Gameiro, Marcio Harker, Shaun et al.

Source: Chaos; Dec2012, Vol. 22 Issue 4, p047508, 16p, 10 Diagrams, 3 Graphs

Subject Terms: GRAPH theory, GLOBAL analysis (Mathematics), GRAPH algorithms, DATABASES, DYNAMICAL systems, DISCRETE systems

Radio Labeling with Preassigned Frequencies: Radio labeling with preassigned frequencies

Authors: Bodlaender, H. L. Broersma, H. J. Fomin, F. V. et al.

Source: Lecture Notes in Computer Science ISBN: 9783540441809
SIAM journal on optimization, 2004, Vol.15(1), pp.1-16 [Peer Reviewed Journal]

Subject Terms: graph algorithms, MSC-94C15, EWI-3456, Cograph, 02 engineering and technology, 0102 computer and information sciences, Frequency assignment, 01 natural sciences, Radio labeling, Graph labelling (graceful graphs, bandwidth, etc.), Coloring of graphs and hypergraphs, MSC-68W25, Applications of graph theory to circuits and networks, \(k\)-coloring, 0202 electrical engineering, electronic engineering, information engineering, Graph algorithms, cograph, approximation algorithm, computational complexity, METIS-208179, K-coloring, Approximation algorithm, Approximation algorithms, Computational complexity, assignment, MSC-05C78, Graph theory (including graph drawing) in computer science, Communication networks in operations research, Wiskunde en Informatica (WIIN), MSC-05C15, IR-65823, MSC-68R10

File Description: application/xml; application/pdf

Access URL: http://dro.dur.ac.uk/617/1/617.pdf
https://zbmath.org/2138041
https://doi.org/10.1137/s1052623402410181
https://research.tue.nl/en/publications/869b74a3-a36c-4fcc-8cbc-1b4070f2cbeb
https://doi.org/10.1007/3-540-45749-6_22
https://research.tue.nl/en/publications/c1012988-cca7-4722-879d-55a47d0fb4c9
https://doi.org/10.1137/S1052623402410181
https://research.utwente.nl/en/publications/390f4d2d-2467-47a7-b036-f89bd50bb9bd
https://research.utwente.nl/en/publications/fd810bfc-f906-4770-bdca-4a2ec92c3d04
https://doi.org/10.1007/3-540-45749-6_22
http://10.10.70.176:8080/experts/en/publications/a21efdf5-7813-4961-878d-329565fe5cca
https://research-portal.uu.nl/en/publications/7ee89017-2e3d-46ce-93e5-48ae1d239a78
https://research-portal.uu.nl/en/publications/f911a182-2ff3-4cdb-bb32-6cfb86009865
https://research.utwente.nl/en/publications/radio-labeling-with-pre-assigned-frequencies
https://dblp.uni-trier.de/db/journals/siamjo/siamjo15.html#BodlaenderBFPW04
https://doi.org/10.1137/S1052623402410181
https://link.springer.com/content/pdf/10.1007%2F3-540-45749-6_22.pdf
https://dro.dur.ac.uk/617/
https://ris.utwente.nl/ws/files/43342946/1636.pdf
https://core.ac.uk/display/103496135
https://dblp.uni-trier.de/db/conf/esa/esa2002.html#BodlaenderBFPW02
https://link.springer.com/content/pdf/10.1007%2F3-540-45749-6_22.pdf
https://utwente-staging.elsevierpure.com/en/publications/radio-labeling-with-pre-assigned-frequencies-2
https://research.utwente.nl/en/publications/radio-labeling-with-pre-assigned-frequencies-2
https://link.springer.com/chapter/10.1007%2F3-540-45749-6_22

Upper and lower bounding procedures for the minimum caterpillar spanning problem

Authors: Simonetti, L. Frota, Y. de Souza, C.C.

Source: Electronic Notes in Discrete Mathematics. Dec2009, Vol. 35, p83-88. 6p.

Subject Terms: Spanning trees, Initial value problems, Graph theory, Heuristic programming, Integer programming, Combinatorics, Mathematical optimization, Algorithms

What Energy Functions Can Be Minimized via graph Cuts?

Authors: Kolmogorov, Vladimir Zabih, Ramin

Source: IEEE Transactions on Pattern Analysis & Machine Intelligence; Feb2004, Vol. 26 Issue 2, p147-159, 13p, 2 Black and White Photographs, 4 Diagrams, 16 Charts

Subject Terms: COMPUTER vision, MATHEMATICAL optimization, GRAPH algorithms, GRAPH theory, MARKOV random fields, RANDOM fields, ARTIFICIAL intelligence

Combinatorial and Hodge Laplacians: Similarities and Differences.

Authors: Ribando-Gros, Emily Rui Wang Jiahui Chen et al.

Source: SIAM Review; 2024, Vol. 66 Issue 3, p575-601, 27p

Subject Terms: DIFFERENTIAL forms, GRAPH theory, SPECTRAL geometry, VECTOR calculus, COMBINATORIAL geometry, EULERIAN graphs, DISCRETE exterior calculus

Graph Isomorphisms and Automorphisms via Spectral Signatures.

Authors: Raviv, Dan Kimmel, Ron Bruckstein, Alfred M.

Source: IEEE Transactions on Pattern Analysis & Machine Intelligence; Aug2013, Vol. 35 Issue 8, p1985-1993, 9p

Subject Terms: ISOMORPHISM (Mathematics), GRAPH theory, AUTOMORPHISMS, BIJECTIONS, COMPUTATIONAL complexity, COMBINATORICS

Scalable Primal Heuristics Using Graph Neural Networks for Combinatorial Optimization.

Authors: Cantürk, Furkan Varol, Taha Aydoğan, Reyhan et al.

Source: Journal of Artificial Intelligence Research; 2024, Vol. 80, p327-376, 50p

Subject Terms: HEURISTIC algorithms, ARTIFICIAL neural networks, GRAPH theory, COMBINATORIAL optimization, MACHINE learning

Figure-ground segmentation based on class-independent shape priors.

Authors: Li, Yang Liu, Yang Liu, Guojun et al.

Source: Journal of Electronic Imaging; Jan/Feb2018, Vol. 27 Issue 1, p1-13, 13p

Subject Terms: IMAGE segmentation, IMAGE processing, ALGORITHMS, GRAPH theory, IMAGE quality analysis

ODD PATHS, CYCLES, AND T-JOINS: CONNECTIONS AND ALGORITHMS.

Authors: SCHLOTTER, ILDIKO SEBŐ, ANDRAS

Source: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 1, p484-504, 21p

Subject Terms: COMBINATORIAL optimization, GRAPH theory, NP-hard problems, UNDIRECTED graphs, CUTTING stock problem

A Probabilistic Approach to Spectral Graph Matching.

Authors: Egozi, Amir Keller, Yosi Guterman, Hugo

Source: IEEE Transactions on Pattern Analysis & Machine Intelligence; Jan2013, Vol. 35 Issue 1, p18-27, 10p

Subject Terms: PROBABILISTIC number theory, GRAPH theory, OBJECT recognition algorithms, DECODING algorithms, DYNAMIC programming, LINEAR programming

EXCLUDING A CLIQUE OR A BICLIQUE IN GRAPHS OF BOUNDED INDUCED MATCHING TREEWIDTH.

Authors: ABRISHAMI, TARA BRIAŃSKI, MARCIN CZYŻEWSKA, JADWIGA et al.

Source: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p1189-1200, 12p

Subject Terms: GRAPH theory, MATCHING theory, POLYNOMIAL time algorithms, BIPARTITE graphs, GRAPH coloring

Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds.

Authors: Hliněný, Petr Jedelský, Jan

Source: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 4, p2003-2048, 46p

Subject Terms: PLANAR graphs, GRAPH theory, MATHEMATICAL bounds, ALGORITHMS

ENUMERATING MINIMAL CONNECTED DOMINATING SETS.

Authors: ABU-KHZAM, FAISAL FERNAU, HENNING GRAS, BENJAMIN et al.

Source: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p946-972, 27p

Subject Terms: DOMINATING set, GRAPH theory, COMPUTATIONAL complexity, NP-complete problems, COMBINATORIAL enumeration problems, MATHEMATICAL bounds

Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights.

Authors: Ding, Wei Chen, Guangting Qiu, Ke et al.

Source: Asia-Pacific Journal of Operational Research; Aug2025, Vol. 42 Issue 4, p1-19, 19p

Subject Terms: WEIGHTED graphs, APPROXIMATION algorithms, GRAPH theory, DIAMETER