EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 101 – 120 of 849

The color-balanced spanning tree problem

Štefan Berežný, Vladimír Lacko (2005)

Kybernetika

Suppose a graph $G = (V, E)$ whose edges are partitioned into $p$ disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number $p$ of categories and present some polynomial algorithm.

The combinatorial structure of eventually nonnegative matrices.

Naqvi, Sarah Carnochan, McDonald, Judith J. (2002)

ELA. The Electronic Journal of Linear Algebra [electronic only]

The combinatorial structure of trigonometry.

Antippa, Adel F. (2003)

International Journal of Mathematics and Mathematical Sciences

The combinatorialization of linear recurrences.

Benjamin, Arthur T., Derks, Halcyon, Quinn, Jennifer J. (2011)

The Electronic Journal of Combinatorics [electronic only]

The combinatorics of certain $k$ -ary meta-Fibonacci sequences.

Ruskey, Frank, Deugau, Chris (2009)

Journal of Integer Sequences [electronic only]

The combinatorics of evolutionary trees---a survey.

Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)

Séminaire Lotharingien de Combinatoire [electronic only]

The combinatorics of Macdonald's $D_{n}^{1}$ operator.

Remmel, Jeffrey (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The combinatorics of orbital varieties closures of nilpotent order 2 in ${sl}_{n}$ .

Melnikov, Anna (2005)

The Electronic Journal of Combinatorics [electronic only]

The combinatorics of quiver representations

Harm Derksen, Jerzy Weyman (2011)

Annales de l’institut Fourier

We give a description of faces, of all codimensions, for the cones spanned by the set of weights associated to the rings of semi-invariants of quivers. For a triple flag quiver and its faces of codimension 1 this description reduces to the result of Knutson-Tao-Woodward on the facets of the Klyachko cone. We give new applications to Littlewood-Richardson coefficients, including a product formula for LR-coefficients corresponding to triples of partitions lying on a wall of the Klyachko cone. We systematically...

The combinatorics of the Al-Salam-Chihara $q$ -Charlier polynomials.

Kim, Dongsu, Stanton, Dennis, Zeng, Jiang (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The combinatorics of the Garsia-Haiman modules for hook shapes.

Adin, Ron M., Remmel, Jeffrey B., Roichman, Yuval (2008)

The Electronic Journal of Combinatorics [electronic only]

The competition numbers of Johnson graphs

Suh-Ryung Kim, Boram Park, Yoshio Sano (2010)

Discussiones Mathematicae Graph Theory

The complete polynomial grid

R. V. Parker (1973)

Matematički Vesnik

The complete product of annihilatingly unique digraphs.

Gan, C.S. (2005)

International Journal of Mathematics and Mathematical Sciences

The complexity of constructing gerechte designs.

Vaughan, E.R. (2009)

The Electronic Journal of Combinatorics [electronic only]

The Complexity of Cutting Complexes.

B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (1989)

Discrete & computational geometry

The complexity of obtaining a distance-balanced graph.

Cabello, Sergio, Lukšič, Primož (2011)

The Electronic Journal of Combinatorics [electronic only]

The complexity of retina operators.

Beauzamy, Bernard (2002)

Journal of Applied Mathematics

The complexity of short schedules for uet bipartite graphs

Evripidis Bampis (1999)

RAIRO - Operations Research - Recherche Opérationnelle

The complexity of short schedules for uet bipartite graphs

Evripidis Bampis (2010)

RAIRO - Operations Research

We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].

Currently displaying 101 – 120 of 849

Previous Page 6 Next