Recent developments on the power graph of finite groups–a survey

A Kumar, L Selvaganesh, PJ Cameron… - … International Journal of …, 2021 - Taylor & Francis
Algebraic graph theory is the study of the interplay between algebraic structures (both
abstract as well as linear structures) and graph theory. Many concepts of abstract algebra …

Chapter V polyhedral combinatorics

WR Pulleyblank - Handbooks in operations research and management …, 1989 - Elsevier
Publisher Summary This chapter discusses the polyhedral combinatorics, which deals with
the interactions between linear algebra, Euclidean geometry, linear programming, and …

[IDÉZET][C] Theory of linear and integer programming

A Schrijver - 1998 - books.google.com
Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en
Informatica, Amsterdam, The Netherlands This book describes the theory of linear and …

[KÖNYV][B] Combinatorial optimization

BH Korte, J Vygen, B Korte, J Vygen - 2011 - Springer
Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

[KÖNYV][B] Hypergraphs: combinatorics of finite sets

C Berge - 1984 - books.google.com
Graph Theory has proved to be an extremely useful tool for solving combinatorial problems
in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations …

[KÖNYV][B] Information theory: coding theorems for discrete memoryless systems

I Csiszár, J Körner - 2011 - books.google.com
Csiszár and Körner's book is widely regarded as a classic in the field of information theory,
providing deep insights and expert treatment of the key theoretical issues. It includes in …

[KÖNYV][B] Geometric algorithms and combinatorial optimization

M Grötschel, L Lovász, A Schrijver - 2012 - books.google.com
Historically, there is a close connection between geometry and optImization. This is
illustrated by methods like the gradient method and the simplex method, which are …

The ellipsoid method and its consequences in combinatorial optimization

M Grötschel, L Lovász, A Schrijver - Combinatorica, 1981 - Springer
LG Khachiyan recently published a polynomial algorithm to check feasibility of a system of
linear inequalities. The method is an adaptation of an algorithm proposed by Shor for non …

[KÖNYV][B] Graph classes: a survey

A Brandstädt, VB Le, JP Spinrad - 1999 - SIAM
When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

[KÖNYV][B] A textbook of graph theory

R Balakrishnan, K Ranganathan - 2012 - books.google.com
Graph theory experienced a tremendous growth in the 20th century. One of the main
reasons for this phenomenon is the applicability of graph theory in other disciplines such as …