Showing 1 - 10 results of 14 for search '"Combinatorial problems."', זמן שאילתה: 0.02s Refine Results
  1. 1

    Disjoint Hamiltonian cycles in recursive circulant graphs. מאת Micheneau, C.

    הוצא לאור ב Information processing letters.
    Article

    Disjoint Hamiltonian cycles in recursive circulant graphs.
  2. 2

    On approximating the memory-Constrained Module Allocation Problem. מאת Roupin, Frederic

    הוצא לאור ב Information processing letters.
    Article

    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. מאת Mosca, Raffaele

    הוצא לאור ב Information processing letters.
    Article

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

    Intersection number of two connected geometric graphs. מאת Tokunaga, Shin-ichi

    הוצא לאור ב Information processing letters.
    Article

    Intersection number of two connected geometric graphs.
  5. 5

    Finding pattern matchings for permutations. מאת Ibarra, Louis

    הוצא לאור ב Information processing letters.
    Article

    Finding pattern matchings for permutations.
  6. 6

    Exact path delay fault coverage with fundamental ZBDD operations. מאת Padmanaban, S.

    Article

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

    Transmission network expansion planning under a Tabu Search approach. מאת Da Silva, E.L

    הוצא לאור ב IEEE Transactions on power systems
    Article

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

    Hypercube permutations routable under all dimension orderings. מאת Panaite, Petrisor

    הוצא לאור ב Information processing letters.
    Article

    Hypercube permutations routable under all dimension orderings.
  9. 9

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

    הוצא לאור ב Information processing letters.
    Article

    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. מאת Thilikos, Dimitrios M.

    הוצא לאור ב Information processing letters.
    Article

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

כלי חיפוש: