Pages that link to "Item:Q4068077"

The following pages link to Design of a new balanced file organization scheme with the least redundancy (Q4068077):

Displaying 10 items.

• Cyclic multiple-valued filing schemes for higher-order queries (Q760811) (← links)
• The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs (Q862676) (← links)
• \(P_{4k-1}\)-factorization of bipartite multigraphs (Q867765) (← links)
• Partition of a query set into minimal number of subsets having consecutive retrieval property (Q1238649) (← links)
• Some filing schemes based on finite groups of automorphisms (Q1245580) (← links)
• On \(K_{p,q}\)-factorization of complete bipartite multigraphs (Q1702451) (← links)
• \(G\)-designs and related designs (Q1802138) (← links)
• Decomposition of the complete hypergraph into hyperclaws (Q1812635) (← links)
• The spectrum of path factorization of bipartite multigraphs (Q2461502) (← links)
• Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws (Q3708843) (← links)