Imagen de Portada

Finding the Center and Centroid of a Graph with Multiple Sources

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Chou, Matthew
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Data Structures and Algorithms Social and Information Networks E.1.3; G.2.2; H.4.0
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
por: Brault, Gregory J., et al.
Publicado: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
por: Chen, Yongyu
Publicado: (2023)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Efficient Approximation of Fractional Hypertree Width
por: Korchemna, Viktoriia, et al.
Publicado: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

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

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
por: Ma, Will, et al.
Publicado: (2024)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
por: Jacob, Ashwin, et al.
Publicado: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
por: Giambartolomei, Giordano, et al.
Publicado: (2023)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
por: Giambartolomei, Giordano, et al.
Publicado: (2024)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2023)

Color-Constrained Arborescences in Edge-Colored Digraphs
por: Ardra, P. S., et al.
Publicado: (2025)

Better Approximation for Weighted $k$-Matroid Intersection
por: Singer, Neta, et al.
Publicado: (2024)

On the thinness of trees
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

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

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

Loop unrolling of UCA models: distance labeling
por: Soulignac, Francisco J, et al.
Publicado: (2022)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
por: Bressan, Marco, et al.
Publicado: (2026)

On Relaxation of Dominant Sets
por: Koster, Max
Publicado: (2022)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
por: Neogi, Rian, et al.
Publicado: (2025)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

Finding Diverse Solutions Parameterized by Cliquewidth
por: Drabik, Karolina, et al.
Publicado: (2024)