Balanced substructures in bicolored graphs

DOI10.1007/978-3-031-23101-8_12MaRDI QIDQ6169522

R. Krithika, Saket Saurabh, P. S. Ardra, Roohani Sharma

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

parameterized complexityedge-colored graphsbalanced subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Representative families: a unified tradeoff-based approach
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time
• On problems without polynomial kernels
• Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
• On zero-sum spanning trees and zero-sum connectivity
• Balanced connected subgraph problem in geometric intersection graphs
• Algorithms and hardness results for the maximum balanced connected subgraph problem
• The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs
• Complexity and inapproximability results for balanced connected subgraph problem
• The recognition of bound quivers using edge-coloured homomorphisms
• Graph Theory
• Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
• Faster Algebraic Algorithms for Path and Packing Problems
• Steiner trees, connected domination and strongly chordal graphs
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Color-coding
• Kernelization Lower Bounds Through Colors and IDs
• LIMITS and Applications of Group Algebras for Parameterized Problems
• Parameterized Algorithms
• On generalized graphs
• The balanced connected subgraph problem

This page was built for publication: Balanced substructures in bicolored graphs