Pages that link to "Item:Q911298"

The following pages link to A linear algorithm for bipartition of biconnected graphs (Q911298):

Displaying 19 items.

• A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
• Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
• Max-min weight balanced connected partition (Q386475) (← links)
• Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
• A plane graph representation of triconnected graphs (Q410724) (← links)
• On minimal arbitrarily partitionable graphs (Q456092) (← links)
• Decomposing trees with large diameter (Q986542) (← links)
• Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
• On the shape of decomposable trees (Q1043555) (← links)
• Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
• Optimal fault-tolerant routings for connected graphs (Q1186600) (← links)
• On the parameterized complexity of 2-partitions (Q2205943) (← links)
• Degree-constrained 2-partitions of graphs (Q2419120) (← links)
• Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
• FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
• Optical implementation of rearrangeable nonblocking double banyan interconnection network in free space (Q3615163) (← links)
• Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
• Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)