Cover Image

Balanced Substructures in Bicolored Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ardra, P. S., Krithika, R., Saurabh, Saket, Sharma, Roohani
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Complexity G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
by: Krithika, R., et al.
Published: (2023)

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

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

Graph Threading with Turn Costs
by: Demaine, Erik D., et al.
Published: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

A Piecewise Approach for the Analysis of Exact Algorithms
by: Clinch, Katie, et al.
Published: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
by: Dvořák, Pavel, et al.
Published: (2017)

Realizing temporal graphs from fastest travel times
by: Klobas, Nina, et al.
Published: (2023)

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

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
by: Jain, Rahul, et al.
Published: (2019)

Large cliques and large independent sets: can they coexist?
by: Feige, Uriel, et al.
Published: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
by: Bougeret, Marin, et al.
Published: (2024)

Spanning Trees Minimizing Branching Costs
by: Gargano, Luisa, et al.
Published: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
by: Gilfanov, Arthur
Published: (2024)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
by: Sarriguren, Alfredo Goñi
Published: (2024)

Identity Testing for Circuits with Exponentiation Gates
by: Li, Jiatu, et al.
Published: (2025)

Towards universally optimal sorting algorithms
by: Sen, Sandeep
Published: (2025)

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

Kernelization dichotomies for hitting minors under structural parameterizations
by: Bougeret, Marin, et al.
Published: (2025)

A Decomposition Approach to the Weighted $k$-server Problem
by: Ayyadevara, Nikhil, et al.
Published: (2024)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
by: Kowaluk, Miroslaw, et al.
Published: (2025)

Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
by: Liao, Chao, et al.
Published: (2022)

A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
by: Greilhuber, Jakob, et al.
Published: (2026)

Speeding-up Graph Algorithms via Clique Partitioning
by: Chavan, Akshar, et al.
Published: (2025)

Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
by: Kaudan, Chirag, et al.
Published: (2026)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
by: Szyfelbein, Michał
Published: (2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
by: Bhandari, Kritika, et al.
Published: (2025)

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

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
by: Dreier, Jan, et al.
Published: (2026)

On the parameterized complexity of computing good edge-labelings
by: de Andrade, Davi, et al.
Published: (2024)

Explicit two-sided unique-neighbor expanders
by: Hsieh, Jun-Ting, et al.
Published: (2023)

Revisiting Path Contraction and Cycle Contraction
by: Krithika, R., et al.
Published: (2024)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
by: Høgemo, Svein
Published: (2024)