Výsledky vyhľadávania - Combinatorial Graph theory Graph algorithms. msc

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

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

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

Predmety: GRAPH theory, GRAPH algorithms

Extension of universal cycles for globally identifying colorings of cycles

Autori: Pierre Coupechoux Coupechoux, Pierre Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC) a ďalší

Prispievatelia: Pierre Coupechoux Coupechoux, Pierre Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC) a ďalší

Zdroj: Discrete Mathematics. 340:1456-1466

Predmety: 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]

Popis súboru: application/pdf

Prístupová URL adresa: 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.

Autori: ABBOUD, AMIR BODWIN, GREG

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

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

Geografický termín: PHILADELPHIA (Pa.), THAILAND

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

Autori: DONNELLY, JON STECHLINSKI, PETER

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

Predmety: GRAPH theory, TRUST, MALWARE, NONSMOOTH optimization, SET theory, GRAPH algorithms, REPUTATION

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

Autori: NEDERLOF, JESPER PILIPCZUK, MICHAŁ SWENNENHUIS, CELINE M. F. a ďalší

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

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

Online, Computable and Punctual Structure Theory.

Autori: Askes, Matthew Downey, Rod

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

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

What Energy Functions Can Be Minimized via graph Cuts?

Autori: Kolmogorov, Vladimir Zabih, Ramin

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

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

Combinatorial and Hodge Laplacians: Similarities and Differences.

Autori: Ribando-Gros, Emily Rui Wang Jiahui Chen a ďalší

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

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

Graph Isomorphisms and Automorphisms via Spectral Signatures.

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

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

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

Scalable Primal Heuristics Using Graph Neural Networks for Combinatorial Optimization.

Autori: Cantürk, Furkan Varol, Taha Aydoğan, Reyhan a ďalší

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

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

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

Autori: Li, Yang Liu, Yang Liu, Guojun a ďalší

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

Predmety: IMAGE segmentation, IMAGE processing, ALGORITHMS, GRAPH theory, IMAGE quality analysis

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

Autori: SCHLOTTER, ILDIKO SEBŐ, ANDRAS

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

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

A Probabilistic Approach to Spectral Graph Matching.

Autori: Egozi, Amir Keller, Yosi Guterman, Hugo

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

Predmety: 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.

Autori: ABRISHAMI, TARA BRIAŃSKI, MARCIN CZYŻEWSKA, JADWIGA a ďalší

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

Predmety: GRAPH theory, MATCHING theory, POLYNOMIAL time algorithms, BIPARTITE graphs, GRAPH coloring

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

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

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

Predmety: PLANAR graphs, GRAPH theory, MATHEMATICAL bounds, ALGORITHMS

ENUMERATING MINIMAL CONNECTED DOMINATING SETS.

Autori: ABU-KHZAM, FAISAL FERNAU, HENNING GRAS, BENJAMIN a ďalší

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

Predmety: 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.

Autori: Ding, Wei Chen, Guangting Qiu, Ke a ďalší

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

Predmety: WEIGHTED graphs, APPROXIMATION algorithms, GRAPH theory, DIAMETER

THE COMPLEXITY OF DIAMETER ON H-FREE GRAPHS.

Autori: OOSTVEEN, JELLE J. PAULUSMA, DANIËL VAN LEEUWEN, ERIK JAN

Zdroj: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p1213-1245, 33p

Predmety: DIAMETER, COMPUTATIONAL complexity, TIME complexity, ALGORITHMS, GRAPH connectivity, SUBGRAPHS, GRAPH theory

A Path Following Algorithm for the Graph Matching Problem.

Autori: Zaslavskiy, Mikhail Bach, Francis Vert, Jean-Philippe

Zdroj: IEEE Transactions on Pattern Analysis & Machine Intelligence; Dec2009, Vol. 31 Issue 12, p2227-2242, 16p, 6 Diagrams, 3 Charts, 7 Graphs

Predmety: GRAPH algorithms, CONVEX programming, MACHINE learning, CONJUGATE gradient methods, CHINESE characters, PERMUTATIONS

Globally Linked Pairs and Cheapest Globally Rigid Supergraphs.

Autori: Jordán, Tibor Villányi, Soma

Zdroj: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 3, p1520-1544, 25p

Predmety: GRAPH theory, NP-hard problems, APPROXIMATION algorithms