Výsledky vyhledávání - Combinatorics Graph theory Graph algorithms. msc*

Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA Autor DIMACS Implementation Challenge Workshop, Bader, David A.

“… To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li…”
Získat plný text

Transitivity in some graph-classes Autor Paul, Subhabrata, Santra, Kamal

“…Let be a graph, where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V , we say A dominates B if every vertex of B is adjacent to at least one vertex of A in…”
Získat plný text

If You are the Smartest Person in the Room, You are in the Wrong Room Autor Sclosa, Davide

“…If taken seriously, the advice in the title leads to interesting combinatorics. Consider N  people moving between M…”
Získat plný text

Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs Autor Hanaka, Tesshu, Ikeyama, Airi, Ono, Hirotaka

“… These games are a variation of graph hedonic games, which are a class of coalition formation games that can be succinctly represented…”
Získat plný text

Approximating the probabilistic p-Center problem under pressure Autor Demange, Marc, Haddad, Marcel A., Murat, Cécile

“… The landscape is divided into zones and is modeled as an edge-weighted graph with vertices corresponding to zones and edges corresponding to direct connections between two adjacent zones…”
Získat plný text

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm Autor Simonetti, L., Frota, Y., de Souza, C.C.

“…A ring star in a graph is a subgraph that can be decomposed into a cycle (or ring) and a set of edges with exactly one vertex in the cycle…”
Získat plný text

Approximation algorithms for some min–max and minimum stacker crane cover problems Autor Sun, Yuhui, Yu, Wei, Liu, Zhaohui

“…We study two stacker crane cover problems and their variants. Given a mixed graph G = ( V , E…”
Získat plný text

Minmax subtree cover problem on cacti Autor Nagamochi, Hiroshi, Kawada, Taizo

Získat plný text

A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks Autor Chesnokov, Andrey, Van Barel, Marc

“…A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks…”
Získat plný text

On an isoperimetric problem for Hamming graphs Autor Harper, L.H.

“…We consider the vertex-isoperimetric problem for the product of complete graphs. This was posed to us by A.R…”
Získat plný text

An approximation algorithm for scheduling dependent tasks on m processors with small communication delays Autor Hanen, C, Munier, A

“…This paper defines and studies an approximation algorithm for scheduling tasks with small communication delays on m processors starting from a schedule σ…”
Získat plný text

Matrix period in max-algebra Autor MOLNAROVA, M, PRIBIS, J

“…) algorithm for computing the exact value of the matrix period for a given matrix is described…”
Získat plný text

Structural aspects of ordered polymatroids Autor Krüger, Ulrich

“…This paper generalizes some aspects of polymatroid theory to partially ordered sets…”
Získat plný text