Εμφανίζονται 1 - 10 Αποτελέσματα από 14 για την αναζήτηση '"Combinatorial problems."', χρόνος αναζήτησης: 0,02δλ Περιορισμός αποτελεσμάτων
  1. 1

    Disjoint Hamiltonian cycles in recursive circulant graphs. ανά Micheneau, C.

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    Disjoint Hamiltonian cycles in recursive circulant graphs.
  2. 2

    On approximating the memory-Constrained Module Allocation Problem. ανά Roupin, Frederic

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    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.
    Άρθρο

    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.
    Άρθρο

    Intersection number of two connected geometric graphs.
  5. 5

    Finding pattern matchings for permutations. ανά Ibarra, Louis

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    Finding pattern matchings for permutations.
  6. 6

    Exact path delay fault coverage with fundamental ZBDD operations. ανά Padmanaban, S.

    Άρθρο

    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
    Άρθρο

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

    Hypercube permutations routable under all dimension orderings. ανά Panaite, Petrisor

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    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.
    Άρθρο

    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.
    Άρθρο

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

Εργαλεία αναζήτησης: