The balanced connected subgraph problem (Q5918764): Difference between revisions

@@ Property / cites work @@
+Bipartite embeddings of trees in the plane
@@ Property / cites work: Bipartite embeddings of trees in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Geometric planar networks on bichromatic points
@@ Property / cites work: Geometric planar networks on bichromatic points / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced partitions of 3-colored geometric sets in the plane
+Normal rank
@@ Property / cites work @@
+The balanced connected subgraph problem
@@ Property / cites work: The balanced connected subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced connected subgraph problem in geometric intersection graphs
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
+Normal rank
@@ Property / cites work @@
+The graph motif problem parameterized by the structure of the input graph
+Normal rank
@@ Property / cites work @@
+Planar bichromatic minimum spanning trees
@@ Property / cites work: Planar bichromatic minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Maximum balanced subgraph problem parameterized above lower bound
+Normal rank
@@ Property / cites work @@
+The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs
+Normal rank
@@ Property / cites work @@
+Finding induced trees
@@ Property / cites work: Finding induced trees / rank @@
+Normal rank
@@ Property / cites work @@
+Matching colored points in the plane: Some new results
+Normal rank
@@ Property / cites work @@
+PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
+Normal rank
@@ Property / cites work @@
+Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for finding connected motifs in vertex-colored graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum colorful cliques in vertex-colored graphs
@@ Property / cites work: Maximum colorful cliques in vertex-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692715
@@ Property / cites work: Q5692715 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorful induced subgraphs
@@ Property / cites work: Colorful induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and hardness results for the maximum balanced connected subgraph problem
+Normal rank