Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized twisted cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of the hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in hypercubes with prescribed origins and lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gray codes with prescribed ends / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient unicast in bijective connection networks with the restricted faulty node set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum path cover of a distance-hereditary graph in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type degree conditions for disjoint path covers in simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal path cover algorithm for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting structures in the Möbius ladder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding $m$-quasistars into $n$-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding disjoint path covers in unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive circulants and their embeddings among hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in cubes of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to construct disjoint path covers of DCell networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability analysis of bijective connection networks in terms of the extra edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Revision as of 08:29, 14 July 2024

scientific article
Language Label Description Also known as
English
Disjoint path covers with path length constraints in restricted hypercube-like graphs
scientific article

    Statements

    Disjoint path covers with path length constraints in restricted hypercube-like graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2017
    0 references
    hypercube-like graph
    0 references
    disjoint path cover
    0 references
    path partition
    0 references
    prescribed sources
    0 references
    prescribed path lengths
    0 references
    fault tolerance
    0 references
    interconnection network
    0 references
    0 references
    0 references
    0 references

    Identifiers