Dangos 1 - 10 canlyniadau o 14 ar gyfer chwilio '"Combinatorial problem."', amser ymholiad: 0.02e Mireinio'r Canlyniadau
  1. 1

    Disjoint Hamiltonian cycles in recursive circulant graphs. gan Micheneau, C.

    Erthygl

    Disjoint Hamiltonian cycles in recursive circulant graphs.
  2. 2

    On approximating the memory-Constrained Module Allocation Problem. gan Roupin, Frederic

    Erthygl

    On approximating the memory-Constrained Module Allocation Problem.
  3. 3

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs. gan Mosca, Raffaele

    Erthygl

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.
  4. 4

    Intersection number of two connected geometric graphs. gan Tokunaga, Shin-ichi

    Erthygl

    Intersection number of two connected geometric graphs.
  5. 5

    Finding pattern matchings for permutations. gan Ibarra, Louis

    Erthygl

    Finding pattern matchings for permutations.
  6. 6

    Exact path delay fault coverage with fundamental ZBDD operations. gan Padmanaban, S.

    Erthygl

    Exact path delay fault coverage with fundamental ZBDD operations.
  7. 7

    Transmission network expansion planning under a Tabu Search approach. gan Da Silva, E.L

    Erthygl

    Transmission network expansion planning under a Tabu Search approach.
  8. 8

    Hypercube permutations routable under all dimension orderings. gan Panaite, Petrisor

    Erthygl

    Hypercube permutations routable under all dimension orderings.
  9. 9

    A note on approximation of the vertex cover and feedback vertex set problems-Unified approach. gan Fujito, Toshihiro

    Erthygl

    A note on approximation of the vertex cover and feedback vertex set problems-Unified approach.
  10. 10

    Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. gan Thilikos, Dimitrios M.

    Erthygl

    Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems.

Offerynnau Chwilio: