Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization

DOI10.1145/322003.322005zbMath0359.05027OpenAlexW2034350206MaRDI QIDQ4132557

No author found.

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322003.322005

Mathematics Subject Classification ID

Related Items (24)

On the \(k\)-path cover problem for cacti ⋮ Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow ⋮ Differential approximation results for the traveling salesman and related problems ⋮ On mapping processes to processors in distributed systems ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs ⋮ Parameterizing path partitions ⋮ Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ Optimal covering of cacti by vertex-disjoint paths ⋮ Finding a minimum path cover of a distance-hereditary graph in polynomial time ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ On the tree packing problem ⋮ An approximation algorithm for the asymmetric travelling salesman problem with distances one and two ⋮ Colinear Coloring on Graphs ⋮ Partitioning graphs into induced subgraphs ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section ⋮ Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures ⋮ The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two ⋮ Path node-covering constants for certain families of trees ⋮ Minimum node disjoint path covering for circular-arc graphs ⋮ GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm ⋮ Chain packing in graphs

This page was built for publication: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization