An overview of graph covering and partitioning (Q2142633): Difference between revisions

@@ Property / cites work @@
+A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
+Normal rank
@@ Property / cites work @@
+\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
+Normal rank
@@ Property / cites work @@
+More on the Bipartite Decomposition of Random Graphs
+Normal rank
@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Factors and factorizations of graphs. Proof techniques in factor theory
+Normal rank
@@ Property / cites work @@
+Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
+Normal rank
@@ Property / cites work @@
+Covering Multigraphs by Simple Circuits
@@ Property / cites work: Covering Multigraphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
+Normal rank
@@ Property / cites work @@
+Covering graphs by the minimum number of equivalence relations
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to police district design
+Normal rank
@@ Property / cites work @@
+Engineering Branch-and-Cut Algorithms for the Equicut Problem
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
+Normal rank
@@ Property / cites work @@
+Solution of a Min-Max Vehicle Routing Problem
@@ Property / cites work: Solution of a Min-Max Vehicle Routing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
+Normal rank
@@ Property / cites work @@
+On the Graph Bisection Cut Polytope
@@ Property / cites work: On the Graph Bisection Cut Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the equicut problem
+Normal rank
@@ Property / cites work @@
+A tabu search heuristic and adaptive memory procedure for political districting
+Normal rank
@@ Property / cites work @@
+On path decompositions of \(2 k\)-regular graphs
@@ Property / cites work: On path decompositions of \(2 k\)-regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest coverings of graphs with cycles
@@ Property / cites work: Shortest coverings of graphs with cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Cover on Sparse Networks
@@ Property / cites work: Clique Cover on Sparse Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3890126
@@ Property / cites work: Q3890126 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796188
@@ Property / cites work: Q4796188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2889270
@@ Property / cites work: Q2889270 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently covering complex networks with cliques of similar vertices
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for max-min partitioning of ladders
+Normal rank
@@ Property / cites work @@
+Max-min partitioning of grid graphs into connected components
+Normal rank
@@ Property / cites work @@
+On biclique coverings
@@ Property / cites work: On biclique coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2912414
@@ Property / cites work: Q2912414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3360905
@@ Property / cites work: Q3360905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3312268
@@ Property / cites work: Q3312268 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic characterization of biclique covers
@@ Property / cites work: Chromatic characterization of biclique covers / rank @@
+Normal rank
@@ Property / cites work @@
+Short Proofs of Some Extremal Results
@@ Property / cites work: Short Proofs of Some Extremal Results / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding multi-constrained spanning trees
+Normal rank
@@ Property / cites work @@
+Exact approaches for solving a covering problem with capacitated subtrees
+Normal rank
@@ Property / cites work @@
+Q3701453
@@ Property / cites work: Q3701453 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining optimal police patrol areas with maximal covering and backup covering location models
+Normal rank
@@ Property / cites work @@
+Q4448745
@@ Property / cites work: Q4448745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3659817
@@ Property / cites work: Q3659817 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms for Edge Clique Cover are Probably Optimal
+Normal rank
@@ Property / cites work @@
+On the relationship between ATSP and the cycle cover problem
+Normal rank
@@ Property / cites work @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the \(k\)-partition polytope
@@ Property / cites work: Facets of the \(k\)-partition polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The equipartition polytope. I: Formulations, dimension and basic facets
+Normal rank
@@ Property / cites work @@
+Q5387695
@@ Property / cites work: Q5387695 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique partitions of complements of forests and bounded degree graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding an edge-partition with max-min ratio at most two
+Normal rank
@@ Property / cites work @@
+Q3691766
@@ Property / cites work: Q3691766 / rank @@
+Normal rank
@@ Property / cites work @@
+Q6075914
@@ Property / cites work: Q6075914 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge clique covers in graphs with independence number two
+Normal rank
@@ Property / cites work @@
+Clique covering the edges of a locally cobipartite graph
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximally balanced connected graph partition
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs
+Normal rank
@@ Property / cites work @@
+A tight bound on the min-ratio edge-partitioning problem of a tree
+Normal rank
@@ Property / cites work @@
+On partitions of graphs into trees
@@ Property / cites work: On partitions of graphs into trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the coverings of graphs
@@ Property / cites work: On the coverings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal clique coverings of complementary graphs
@@ Property / cites work: Extremal clique coverings of complementary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Clique-Web Facets for Multicut Polytopes
@@ Property / cites work: Clique-Web Facets for Multicut Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+On the decomposition of graphs into complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+An upper bound for the path number of a graph
@@ Property / cites work: An upper bound for the path number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Clique partitions and clique coverings
@@ Property / cites work: Clique partitions and clique coverings / rank @@
+Normal rank
@@ Property / cites work @@
+The Representation of a Graph by Set Intersections
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a graph by complete bipartite graphs
@@ Property / cites work: Covering a graph by complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A dual bounding scheme for a territory design problem
+Normal rank
@@ Property / cites work @@
+Min-max tree covers of graphs.
@@ Property / cites work: Min-max tree covers of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+On the kernel size of clique cover reductions for random intersection graphs
+Normal rank
@@ Property / cites work @@
+Bipartite dimensions and bipartite degrees of graphs
+Normal rank
@@ Property / cites work @@
+Covering a graph with cuts of minimum total size
@@ Property / cites work: Covering a graph with cuts of minimum total size / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max cover of a graph with a small number of parts
+Normal rank
@@ Property / cites work @@
+Solving a large scale districting problem: A case report
+Normal rank
@@ Property / cites work @@
+Q3753826
@@ Property / cites work: Q3753826 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph coverings and edge switchings
@@ Property / cites work: Subgraph coverings and edge switchings / rank @@
+Normal rank
@@ Property / cites work @@
+Path decompositions and Gallai's conjecture
@@ Property / cites work: Path decompositions and Gallai's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344209
@@ Property / cites work: Q4344209 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs of two minimum circuit cover conjectures
@@ Property / cites work: Proofs of two minimum circuit cover conjectures / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and valid inequalities of the node capacitated graph partitioning problem
+Normal rank
@@ Property / cites work @@
+The node capacitated graph partitioning problem: A computational study
+Normal rank
@@ Property / cites work @@
+Q3877805
@@ Property / cites work: Q3877805 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle covering in bridgeless graphs
@@ Property / cites work: Cycle covering in bridgeless graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138951
@@ Property / cites work: Q3138951 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of Christofides heuristic to the k-person travelling salesman problem
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the k-cut Problem for Fixed k
+Normal rank
@@ Property / cites work @@
+Geometric Mesh Partitioning: Implementation and Experiments
+Normal rank
@@ Property / cites work @@
+Community structure in social and biological networks
+Normal rank
@@ Property / cites work @@
+Optimal Political Districting by Implicit Enumeration Techniques
+Normal rank
@@ Property / cites work @@
+Q5663904
@@ Property / cites work: Q5663904 / rank @@
+Normal rank
@@ Property / cites work @@
+On a clique covering problem of Orlin
@@ Property / cites work: On a clique covering problem of Orlin / rank @@
+Normal rank
@@ Property / cites work @@
+Q5203068
@@ Property / cites work: Q5203068 / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for a clustering problem
+Normal rank
@@ Property / cites work @@
+Facets of the clique partitioning polytope
@@ Property / cites work: Facets of the clique partitioning polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Biclique decompositions and Hermitian rank
@@ Property / cites work: Biclique decompositions and Hermitian rank / rank @@
+Normal rank
@@ Property / cites work @@
+Path and cycle decompositions of dense graphs
@@ Property / cites work: Path and cycle decompositions of dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of constrained classification
@@ Property / cites work: A survey of constrained classification / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for compact letter displays: comparison and evaluation
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
+Normal rank
@@ Property / cites work @@
+A simple lower bound on edge coverings by cliques
@@ Property / cites work: A simple lower bound on edge coverings by cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
+Normal rank
@@ Property / cites work @@
+The biparticity of a graph
@@ Property / cites work: The biparticity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster analysis and mathematical programming
@@ Property / cites work: Cluster analysis and mathematical programming / rank @@
+Normal rank
@@ Property / cites work @@
+Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search
@@ Property / cites work: Variable Neighborhood Search / rank @@
+Normal rank
@@ Property / cites work @@
+The Bounded Cycle-Cover Problem
@@ Property / cites work: The Bounded Cycle-Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Cartesian Parallel Nested Dissection Algorithm
@@ Property / cites work: A Cartesian Parallel Nested Dissection Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>r</i>-Dimensional Quadratic Placement Algorithm
+Normal rank
@@ Property / cites work @@
+Maximum split clustering under connectivity constraints
+Normal rank
@@ Property / cites work @@
+On Restricted Two-Factors
@@ Property / cites work: On Restricted Two-Factors / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed-integer programming techniques for the connected max-\(k\)-cut problem
+Normal rank
@@ Property / cites work @@
+Q4016827
@@ Property / cites work: Q4016827 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cycle partition with length requirements
@@ Property / cites work: Minimum cycle partition with length requirements / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Simple Circuits
@@ Property / cites work: Covering Graphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a weighted tree into subtrees with weights in a given range
+Normal rank
@@ Property / cites work @@
+Edge clique cover of claw‐free graphs
@@ Property / cites work: Edge clique cover of claw‐free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On covering graphs by complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Local Clique Covering of Claw-Free Graphs
@@ Property / cites work: Local Clique Covering of Claw-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On partitioning the edges of graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Q3142415
@@ Property / cites work: Q3142415 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3710541
@@ Property / cites work: Q3710541 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+A Linear Tree Partitioning Algorithm
@@ Property / cites work: A Linear Tree Partitioning Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of the minimum-weight \(k\)-size cycle cover problem
+Normal rank
@@ Property / cites work @@
+A bound on the total size of a cut cover
@@ Property / cites work: A bound on the total size of a cut cover / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+Three ways to cover a graph
@@ Property / cites work: Three ways to cover a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing Graphs into Edges and Triangles
@@ Property / cites work: Decomposing Graphs into Edges and Triangles / rank @@
+Normal rank
@@ Property / cites work @@
+Two exact algorithms for the distance-constrained vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Optimal Routing under Capacity and Distance Restrictions
+Normal rank
@@ Property / cites work @@
+Size-constrained graph partitioning polytopes
@@ Property / cites work: Size-constrained graph partitioning polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Most uniform path partitioning and its use in image processing
+Normal rank
@@ Property / cites work @@
+Graph partitioning using linear and semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the Distance Constrained Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for the rooted budgeted cycle cover problem
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem: An overview of exact and approximate algorithms
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
+Normal rank
@@ Property / cites work @@
+Q5539649
@@ Property / cites work: Q5539649 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimization Based Heuristic for Political Districting
+Normal rank
@@ Property / cites work @@
+Approximation and parameterized algorithms for balanced connected partition problems
+Normal rank
@@ Property / cites work @@
+Q4846548
@@ Property / cites work: Q4846548 / rank @@
+Normal rank
@@ Property / cites work @@
+A spanning tree heuristic for regional clustering
@@ Property / cites work: A spanning tree heuristic for regional clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering on trees
@@ Property / cites work: Clustering on trees / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques and clustering: A combinatorial approach
@@ Property / cites work: Cliques and clustering: A combinatorial approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035328
@@ Property / cites work: Q3035328 / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximating Restricted Cycle Covers
@@ Property / cites work: On Approximating Restricted Cycle Covers / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the edges of a graph by three odd subgraphs
+Normal rank
@@ Property / cites work @@
+A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
+Normal rank
@@ Property / cites work @@
+Cut and flow formulations for the balanced connected \(k\)-partition problem
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into balanced connected classes: formulations, separation and experiments
+Normal rank
@@ Property / cites work @@
+On edge perfectness and classes of bipartite graphs
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for distance constrained vehicle routing problems
+Normal rank
@@ Property / cites work @@
+The clique partitioning problem: Facets and patching facets
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3942989
@@ Property / cites work: Q3942989 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922718
@@ Property / cites work: Q3922718 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922720
@@ Property / cites work: Q3922720 / rank @@
+Normal rank
@@ Property / cites work @@
+Coverability of graph by three odd subgraphs
@@ Property / cites work: Coverability of graph by three odd subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Min Tree Partitioning
@@ Property / cites work: Max-Min Tree Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Clique coverings of graphs V: maximal-clique partitions
+Normal rank
@@ Property / cites work @@
+Q2912416
@@ Property / cites work: Q2912416 / rank @@
+Normal rank
@@ Property / cites work @@
+Biclique covers and partitions
@@ Property / cites work: Biclique covers and partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Graph factors and factorization: 1985--2003: a survey
+Normal rank
@@ Property / cites work @@
+Q3309876
@@ Property / cites work: Q3309876 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Covering of Graphs IV. Algorithms
@@ Property / cites work: Clique Covering of Graphs IV. Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An Erdős-Gallai conjecture
@@ Property / cites work: An Erdős-Gallai conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137210
@@ Property / cites work: Q3137210 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the edges of a connected graph by paths
@@ Property / cites work: Covering the edges of a connected graph by paths / rank @@
+Normal rank
@@ Property / cites work @@
+A reactive GRASP for a commercial territory design problem with multiple balancing requirements
+Normal rank
@@ Property / cites work @@
+Local search algorithms for political districting
@@ Property / cites work: Local search algorithms for political districting / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted Voronoi region algorithms for political districting
+Normal rank
@@ Property / cites work @@
+Political districting: from classical models to recent approaches
+Normal rank
@@ Property / cites work @@
+Regarding two conjectures on clique and biclique partitions
+Normal rank
@@ Property / cites work @@
+Optimal Districting and Territory Design
@@ Property / cites work: Optimal Districting and Territory Design / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of edge coverings by cliques
@@ Property / cites work: Applications of edge coverings by cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Fast constructive and improvement heuristics for edge clique covering
+Normal rank
@@ Property / cites work @@
+Q4540048
@@ Property / cites work: Q4540048 / rank @@
+Normal rank
@@ Property / cites work @@
+Some new classes of facets for the equicut polytope
+Normal rank
@@ Property / cites work @@
+New models for commercial territory design
@@ Property / cites work: New models for commercial territory design / rank @@
+Normal rank
@@ Property / cites work @@
+Graph clustering
@@ Property / cites work: Graph clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796190
@@ Property / cites work: Q4796190 / rank @@
+Normal rank
@@ Property / cites work @@
+\(b\)-tree facets for the simple graph partitioning polytope
+Normal rank
@@ Property / cites work @@
+Facet-defining inequalities for the simple graph partitioning polytope
+Normal rank
@@ Property / cites work @@
+Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Finding a Minimum Cycle Cover of a Graph
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank
@@ Property / cites work @@
+On the decomposition ofkn into complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+Covering the edge set of a directed graph with trees
+Normal rank
@@ Property / cites work @@
+On clique partitions of split graphs
@@ Property / cites work: On clique partitions of split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic values of clique partition numbers
@@ Property / cites work: Asymptotic values of clique partition numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional biclique covers and partitions of graphs
+Normal rank
@@ Property / cites work @@
+FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min-Max Cycle Cover Problems
+Normal rank
@@ Property / cites work @@
+Approximation hardness of min-max tree covers
@@ Property / cites work: Approximation hardness of min-max tree covers / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation results for a min-max location-routing problem
+Normal rank
@@ Property / cites work @@
+Better approximability results for min-max tree/cycle/path cover problems
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for the minimum cycle cover problem
+Normal rank
@@ Property / cites work @@
+New LP relaxations for minimum cycle/path/tree cover problems
+Normal rank
@@ Property / cites work @@
+Path decomposition of graphs with given path length
+Normal rank
@@ Property / cites work @@
+Circuit Double Covers of Graphs
@@ Property / cites work: Circuit Double Covers of Graphs / rank @@
+Normal rank