Search Results - Combinatorics Graph theory Graph algorithms. msc
-
1
Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA
ISBN: 9780821890387, 0821890387Published: Providence, R.I American Mathematical Society 2013“… To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li…”
Get full text
eBook Book -
2
Transitivity in some graph-classes
ISSN: 1382-6905, 1573-2886Published: New York Springer US 01.10.2025Published in Journal of combinatorial optimization (01.10.2025)“…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…”
Get full text
Journal Article -
3
Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs
ISSN: 1382-6905, 1573-2886Published: New York Springer US 01.04.2025Published in Journal of combinatorial optimization (01.04.2025)“… These games are a variation of graph hedonic games, which are a class of coalition formation games that can be succinctly represented…”
Get full text
Journal Article -
4
If You are the Smartest Person in the Room, You are in the Wrong Room
ISSN: 0911-0119, 1435-5914Published: Tokyo Springer Japan 01.10.2025Published in Graphs and combinatorics (01.10.2025)“…If taken seriously, the advice in the title leads to interesting combinatorics. Consider N people moving between M…”
Get full text
Journal Article -
5
A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks
ISSN: 0377-0427, 1879-1778Published: Kidlington Elsevier B.V 01.07.2010Published in Journal of computational and applied mathematics (01.07.2010)“…A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks…”
Get full text
Journal Article -
6
Minmax subtree cover problem on cacti
ISSN: 0166-218XPublished: Lausanne Elsevier 15.05.2006Published in Discrete Applied Mathematics (15.05.2006)Get full text
Journal Article -
7
On an isoperimetric problem for Hamming graphs
ISSN: 0166-218X, 1872-6771Published: Lausanne Elsevier B.V 30.07.1999Published in Discrete Applied Mathematics (30.07.1999)“…We consider the vertex-isoperimetric problem for the product of complete graphs. This was posed to us by A.R…”
Get full text
Journal Article Conference Proceeding -
8
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
ISSN: 0166-218X, 1872-6771Published: Lausanne Elsevier B.V 15.03.2001Published in Discrete Applied Mathematics (15.03.2001)“…This paper defines and studies an approximation algorithm for scheduling tasks with small communication delays on m processors starting from a schedule σ…”
Get full text
Journal Article -
9
Matrix period in max-algebra
ISSN: 0166-218X, 1872-6771Published: Lausanne Elsevier B.V 15.07.2000Published in Discrete Applied Mathematics (15.07.2000)“…) algorithm for computing the exact value of the matrix period for a given matrix is described…”
Get full text
Journal Article -
10
Structural aspects of ordered polymatroids
ISSN: 0166-218X, 1872-6771Published: Lausanne Elsevier B.V 01.02.2000Published in Discrete Applied Mathematics (01.02.2000)“…This paper generalizes some aspects of polymatroid theory to partially ordered sets…”
Get full text
Journal Article Conference Proceeding

