Mostrando 1 - 10 Resultados de 14 Para Buscar '"Combinatorial problems."', tiempo de consulta: 0.02s Limitar resultados
  1. 1

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

    Artículo

    Disjoint Hamiltonian cycles in recursive circulant graphs.
  2. 2

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

    Artículo

    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. por Mosca, Raffaele

    Artículo

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

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

    Artículo

    Intersection number of two connected geometric graphs.
  5. 5

    Finding pattern matchings for permutations. por Ibarra, Louis

    Artículo

    Finding pattern matchings for permutations.
  6. 6

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

    Artículo

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

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

    Artículo

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

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

    Artículo

    Hypercube permutations routable under all dimension orderings.
  9. 9

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

    Artículo

    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. por Thilikos, Dimitrios M.

    Artículo

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

Herramientas de búsqueda: