Sökresultat - "Combinatorial problems."

1

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

I publikationen Information processing letters.

Artikel

Disjoint Hamiltonian cycles in recursive circulant graphs.

2

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

I publikationen Information processing letters.

Artikel

On approximating the memory-Constrained Module Allocation Problem.

3

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

I publikationen Information processing letters.

Artikel

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

4

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

I publikationen Information processing letters.

Artikel

Intersection number of two connected geometric graphs.

5

Finding pattern matchings for permutations. av Ibarra, Louis

I publikationen Information processing letters.

Artikel

Finding pattern matchings for permutations.

6

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

I publikationen IEEE Transactions on computer-aided design of integrated circuits and systems

Artikel

Exact path delay fault coverage with fundamental ZBDD operations.

7

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

I publikationen IEEE Transactions on power systems

Artikel

Transmission network expansion planning under a Tabu Search approach.

8

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

I publikationen Information processing letters.

Artikel

Hypercube permutations routable under all dimension orderings.

9

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

I publikationen Information processing letters.

Artikel

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

10

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

I publikationen Information processing letters.

Artikel

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

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

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

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

Finding pattern matchings for permutations. av Ibarra, Louis

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

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

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

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

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

Sökverktyg:

Förfina resultatet

DATABASE

AUTHOR

RESOURCE TYPE

LANGUAGE