:: Library Catalog

Salvato in:

Dettagli Bibliografici
Autori principali:	Silva, Mateus C., Melo, Rafael A., Resende, Mauricio G. C., Santos, Marcio C., Toso, Rodrigo F.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Discrete Mathematics F.2; G.2
Accesso online:	https://arxiv.org/abs/2411.14533
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem
di: Festa, Paola, et al.
Pubblicazione: (2024)

Development of an adaptive genetic algorithm for simulation optimization
di: Rafael de Carvalho Miranda
Pubblicazione: (2015)

Graphs without a 3-connected subgraph are 4-colorable
di: Bonnet, Édouard, et al.
Pubblicazione: (2024)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
di: De Meyer, Lucas, et al.
Pubblicazione: (2025)

New Results on Edge-coloring and Total-coloring of Split Graphs
di: Couto, Fernanda, et al.
Pubblicazione: (2023)

Edge coloring lattice graphs
di: Kattemölle, Joris
Pubblicazione: (2024)

Expanded-clique graphs and the domination problem
di: Dourado, Mitre C., et al.
Pubblicazione: (2022)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
di: Behera, Diptimaya, et al.
Pubblicazione: (2025)

Mathematical Formulations And Results Regarding Two Echelon Electric Vehicle Routing Problems
di: Akbay, Mehmet Anıl, et al.
Pubblicazione: (2024)

Faster algorithms on linear delta-matroids
di: Koana, Tomohiro, et al.
Pubblicazione: (2024)

On λ-backbone coloring of cliques with tree backbones in linear time
di: Michalik, Krzysztof, et al.
Pubblicazione: (2021)

Reduction of the graph isomorphism problem to equality checking of $n$-variables polynomials and the algorithms that use the reduction
di: Prolubnikov, Alexander
Pubblicazione: (2015)

A polynomial-time algorithm for recognizing high-bandwidth graphs
di: Varona, Luis M. B.
Pubblicazione: (2026)

A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
di: Matsui, Yasuko, et al.
Pubblicazione: (2024)

Random-key genetic algorithms: Principles and applications
di: Londe, Mariana A., et al.
Pubblicazione: (2025)

On some randomized algorithms and their evaluation
di: Yordzhev, Krasimir
Pubblicazione: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
di: Scheffler, Robert
Pubblicazione: (2025)

Models of random spanning trees
di: Babson, Eric, et al.
Pubblicazione: (2024)

Edge-coloring problems with forbidden patterns and planted colors
di: Barsukov, Alexey, et al.
Pubblicazione: (2025)

Reconstructing graphs and their connectivity using graphlets
di: Hartman, David, et al.
Pubblicazione: (2025)

Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
di: Basavaraju, Manu, et al.
Pubblicazione: (2021)

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
di: Istrate, Gabriel
Pubblicazione: (2024)

Improved Dynamics for the Maximum Common Subgraph Problem
di: Guidobene, Davide, et al.
Pubblicazione: (2024)

Temporal Connectivity Augmentation
di: Bellitto, T., et al.
Pubblicazione: (2025)

On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality
di: Abdenbi, Moussa, et al.
Pubblicazione: (2024)

Constructions, bounds, and algorithms for peaceable queens
di: Clinch, Katie, et al.
Pubblicazione: (2024)

A heuristic search algorithm for discovering large Condorcet domains
di: Zhou, Bei, et al.
Pubblicazione: (2023)

Algorithmic methods of finite discrete structures. The Four Color Theorem. Theory, methods, algorithms
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
di: Zaker, Manouchehr
Pubblicazione: (2024)

On the complexity of a maintenance problem for hierarchical systems
di: Schulz, Andreas S., et al.
Pubblicazione: (2023)

Fast algorithm for $S$-packing coloring of Halin graphs
di: Zhang, Xin, et al.
Pubblicazione: (2025)

On near optimal colorable graphs
di: Angeliya, C. U., et al.
Pubblicazione: (2025)

Graphs with unique Grundy dominating sets
di: Brešar, Boštjan, et al.
Pubblicazione: (2021)

A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
di: De, Koustav
Pubblicazione: (2025)

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
di: Araki, Toru
Pubblicazione: (2026)

Revisiting classical results on kernels in digraphs
di: Langlois, Hélène, et al.
Pubblicazione: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
di: Adler, Isolde, et al.
Pubblicazione: (2024)

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
di: Goldberg, Noam, et al.
Pubblicazione: (2026)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
di: Deligkas, Argyrios, et al.
Pubblicazione: (2024)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
di: Büngener, Aaron, et al.
Pubblicazione: (2024)