Výsledky vyhľadávania - Combinatorial Graph theory Graph algorithms. msc
-
1
If You are the Smartest Person in the Room, You are in the Wrong Room
ISSN: 0911-0119, 1435-5914Vydavateľské údaje: Tokyo Springer Japan 01.10.2025Vydané v Graphs and combinatorics (01.10.2025)“… ) be the directed graph with vertices representing all M N configurations and edges representing possible moves…”
Získať plný text
Journal Article -
2
Transitivity in some graph-classes
ISSN: 1382-6905, 1573-2886Vydavateľské údaje: New York Springer US 01.10.2025Vydané v 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…”
Získať plný text
Journal Article -
3
Efficient Algorithm for Generating Maximal L-Reflexive Trees
ISSN: 2073-8994, 2073-8994Vydavateľské údaje: Basel MDPI AG 01.05.2020Vydané v Symmetry (Basel) (01.05.2020)“… Reflexive graphs give combinatorial ground to generate two classes of algebraic numbers, Salem and Pisot numbers…”
Získať plný text
Journal Article -
4
Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs
ISSN: 1382-6905, 1573-2886Vydavateľské údaje: New York Springer US 01.04.2025Vydané v 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…”
Získať plný text
Journal Article -
5
On an isoperimetric problem for Hamming graphs
ISSN: 0166-218X, 1872-6771Vydavateľské údaje: Lausanne Elsevier B.V 30.07.1999Vydané v Discrete Applied Mathematics (30.07.1999)“… Urbanke who wished to apply it in error-correcting coding theory. The problem does not have nested solutions, so the known combinatorial methods are ineffectual…”
Získať plný text
Journal Article Konferenčný príspevok.. -
6
On complexity, representation and approximation of integral multicommodity flows
ISSN: 0166-218X, 1872-6771Vydavateľské údaje: Lausanne Elsevier B.V 01.02.2000Vydané v Discrete Applied Mathematics (01.02.2000)“… approximation algorithms using the randomized rounding/derandomization scheme provided that the components of the right-hand side vector (resp. the capacities) are in Ω(ε −2 log m…”
Získať plný text
Journal Article Konferenčný príspevok.. -
7
Structural aspects of ordered polymatroids
ISSN: 0166-218X, 1872-6771Vydavateľské údaje: Lausanne Elsevier B.V 01.02.2000Vydané v Discrete Applied Mathematics (01.02.2000)“…This paper generalizes some aspects of polymatroid theory to partially ordered sets…”
Získať plný text
Journal Article Konferenčný príspevok..