Search Results - Combinatorics Graph theory Graph algorithms. msc

  • Showing 1 - 10 results of 10
Refine Results
  1. 1

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

    ISBN: 9780821890387, 0821890387
    Published: 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. 2

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

    ISSN: 1382-6905, 1573-2886
    Published: New York Springer US 01.10.2025
    Published 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. 3

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

    ISSN: 1382-6905, 1573-2886
    Published: New York Springer US 01.04.2025
    Published 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. 4

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

    ISSN: 0911-0119, 1435-5914
    Published: Tokyo Springer Japan 01.10.2025
    Published 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. 5

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

    ISSN: 0377-0427, 1879-1778
    Published: Kidlington Elsevier B.V 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. 6

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

    ISSN: 0166-218X
    Published: Lausanne Elsevier 15.05.2006
    Published in Discrete Applied Mathematics (15.05.2006)
    Get full text
    Journal Article
  7. 7

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

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 30.07.1999
    Published 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. 8

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

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 15.03.2001
    Published 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. 9

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

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 15.07.2000
    Published 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. 10

    Structural aspects of ordered polymatroids by Krüger, Ulrich

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 01.02.2000
    Published 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