Search Results - Combinatorial Graph theory Graph algorithms. msc*

Upward Book Embeddability of st-Graphs: Complexity and Algorithms by Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio

“… = 1 and NP-complete for k = 6 . Closing this gap has been a central question in algorithmic graph theory…”
Get full text

A memetic algorithm for the Minimum Sum Coloring Problem by Jin, Yan, Hao, Jin-Kao, Hamiez, Jean-Philippe

“…Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors…”
Get full text

Efficient Algorithm for Generating Maximal L-Reflexive Trees by Andelic, Milica, Zivkovic, Dejan

“… Reflexive graphs give combinatorial ground to generate two classes of algebraic numbers, Salem and Pisot numbers…”
Get full text

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

“… ) be the directed graph with vertices representing all  M N configurations and edges representing possible moves…”
Get full text

Approximating the probabilistic p-Center problem under pressure by 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…”
Get full text

Transitivity in some graph-classes by 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…”
Get full text

Methodologies and Algorithms for Group-Rankings Decision by Hochbaum, Dorit S, Levin, Asaf

“… The dynamics of the group aggregation of individual decisions has been a subject of central importance in decision theory…”
Get full text

Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs by 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…”
Get full text

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation by Mingozzi, Aristide, Maniezzo, Vittorio, Ricciardelli, Salvatore, Bianco, Lucio

“… the value of the longest path on the precedence graph and are tighter than the bound proposed by Stinson et al. (1978…”
Get full text

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm by 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…”
Get full text

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

“… 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…”
Get full text

On the Core and f-Nucleolus of Flow Games by Kern, Walter, Paulusma, Daniel

“… 17th ACM-SIAM Sympos. Discrete Algorithms . ACM Press, New York, 124–131] and Potters et al. [Potters, J., H. Reijnierse, A. Biswas. 2006. The nucleolus of balanced simple flow networks…”
Get full text

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

“…We study two stacker crane cover problems and their variants. Given a mixed graph G = ( V , E…”
Get full text

A New Graph-Theoretic Heuristic for Facility Layout by Leung, Janny

“… This problem can be modelled as that of finding a maximum weight planar subgraph of a graph, given a measure of the desirability that two machines be adjacent based on the anticipated flows…”
Get full text

Parametric Solution for Linear Bicriteria Knapsack Models by Eben-Chaime, Moshe

“…Linear weighing is a common approach to handle multiple criteria and the "knapsack" is a well-known combinatorial optimization problem…”
Get full text

On the Maximum Quadratic Assignment Problem by Nagarajan, Viswanath, Sviridenko, Maxim

“…Quadratic assignment is a basic problem in combinatorial optimization that generalizes several other problems such as traveling salesman, linear arrangement, dense k subgraph, and clustering with given sizes…”
Get full text

A New Algorithm for Computing the Maximal Closure of a Graph by Faaland, Bruce, Kim, Kiseog, Schmitt, Tom

“…A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset…”
Get full text

The Dynamics of Plant Layout by Rosenblatt, Meir J

“…The problem of plant layout has generally been treated as a static one. In this paper, we deal with the dynamic nature of this problem. Both optimal and…”
Get full text

Heuristics with Constant Error Guarantees for the Design of Tree Networks by Altinkemer, Kemal, Gavish, Bezalel

“… This paper describes an efficient heuristic algorithm based on partitioning of a traveling salesman tour…”
Get full text

Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions by Murthy, Ishwar, Sarkar, Sumit

“… The principal contribution of this paper is the development of exact algorithms to solve large problem instances…”
Get full text