A new approach to maximum matching in general graphs

2005 ◽  
pp. 586-597 ◽  
Author(s):  
Norbert Blum
Keyword(s):  
Maximum Matching ◽  
New Approach ◽  
General Graphs

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2015 ◽  
pp. 2002-2015
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Combinatorial Optimization ◽  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
New Approach ◽  
Coloring Problem ◽  
Graph Coloring Problem ◽  
First Time ◽  
General Graphs

A very promising approach for combinatorial optimization is evolutionary algorithms. As an application, this paper deals with the strict strong graph coloring problem defined by Haddad and Kheddouci (2009) where the authors have proposed an exact polynomial time algorithm for trees. The aim of this paper is to introduce a new evolutionary algorithm for solving this problem for general graphs. It combines an original crossover and a powerful correction operator. Experiments of this new approach are carried out on large Dimacs Challenge benchmark graphs. Results show very competitive with and even better than those of state of the art algorithms. To the best of the author's knowledge, it is the first time that an evolutionary algorithm is proposed to solve the strict strong graph coloring problem.

scholarly journals The Power of Linear-Time Data Reduction for Maximum Matching

Algorithmica ◽  
2020 ◽  
Vol 82 (12) ◽  
pp. 3521-3565
Author(s):  
George B. Mertzios ◽  
André Nichterlein ◽  
Rolf Niedermeier
Keyword(s):  
Systematic Study ◽  
Data Reduction ◽  
Linear Time ◽  
Maximum Matching ◽  
Maximum Cardinality ◽  
Solution Strategy ◽  
Time Data ◽  
Undirected Graphs ◽  
Running Time ◽  
General Graphs

Abstract Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For m-edge and n-vertex graphs, it is well-known to be solvable in $$O(m\sqrt{n})$$ O ( m n )  time; however, for several applications this running time is still too slow. We investigate how linear-time (and almost linear-time) data reduction (used as preprocessing) can alleviate the situation. More specifically, we focus on linear-time kernelization. We start a deeper and systematic study both for general graphs and for bipartite graphs. Our data reduction algorithms easily comply (in form of preprocessing) with every solution strategy (exact, approximate, heuristic), thus making them attractive in various settings.

An efficient distributed algorithm for maximum matching in general graphs

Algorithmica ◽  
1990 ◽  
Vol 5 (1-4) ◽  
pp. 383-406 ◽  
Author(s):  
Michael M. Wu ◽  
Michael C. Loui
Keyword(s):  
Distributed Algorithm ◽  
Maximum Matching ◽  
General Graphs

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2014 ◽  
Vol 5 (2) ◽  
pp. 22-36 ◽  
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
New Approach ◽  
Coloring Problem ◽  
Graph Coloring Problem ◽  
First Time ◽  
General Graphs ◽  
Better Than

A very promising approach for combinatorial optimization is evolutionary algorithms. As an application, this paper deals with the strict strong graph coloring problem defined by Haddad and Kheddouci (2009) where the authors have proposed an exact polynomial time algorithm for trees. The aim of this paper is to introduce a new evolutionary algorithm for solving this problem for general graphs. It combines an original crossover and a powerful correction operator. Experiments of this new approach are carried out on large Dimacs Challenge benchmark graphs. Results show very competitive with and even better than those of state of the art algorithms. To the best of the author's knowledge, it is the first time that an evolutionary algorithm is proposed to solve the strict strong graph coloring problem.

The O–C diagrams of minor planets − a new approach to modelling the rotation

1999 ◽  
Vol 173 ◽  
pp. 185-188
Author(s):  
Gy. Szabó ◽  
K. Sárneczky ◽  
L.L. Kiss
Keyword(s):  
Error Analysis ◽  
Time Dependence ◽  
Theoretical Work ◽  
Minor Planet ◽  
Minor Planets ◽  
New Approach ◽  
Preliminary Results ◽  
Ccd Observations

AbstractA widely used tool in studying quasi-monoperiodic processes is the O–C diagram. This paper deals with the application of this diagram in minor planet studies. The main difference between our approach and the classical O–C diagram is that we transform the epoch (=time) dependence into the geocentric longitude domain. We outline a rotation modelling using this modified O–C and illustrate the abilities with detailed error analysis. The primary assumption, that the monotonity and the shape of this diagram is (almost) independent of the geometry of the asteroids is discussed and tested. The monotonity enables an unambiguous distinction between the prograde and retrograde rotation, thus the four-fold (or in some cases the two-fold) ambiguities can be avoided. This turned out to be the main advantage of the O–C examination. As an extension to the theoretical work, we present some preliminary results on 1727 Mette based on new CCD observations.

A New Approach to the Demonstration of Oxidase-Localization Using Tannic Acid Or Catechin

1973 ◽  
Vol 31 ◽  
pp. 698-699
Author(s):  
V. Mizuhira ◽  
Y. Futaesaku
Keyword(s):  
Cross Section ◽  
Tannic Acid ◽  
Elastic Fiber ◽  
The Other ◽  
New Approach ◽  
Tissue Block ◽  
Active Reaction ◽  
The Cross

Previously we reported that tannic acid is a very effective fixative for proteins including polypeptides. Especially, in the cross section of microtubules, thirteen submits in A-tubule and eleven in B-tubule could be observed very clearly. An elastic fiber could be demonstrated very clearly, as an electron opaque, homogeneous fiber. However, tannic acid did not penetrate into the deep portion of the tissue-block. So we tried Catechin. This shows almost the same chemical natures as that of proteins, as tannic acid. Moreover, we thought that catechin should have two active-reaction sites, one is phenol,and the other is catechole. Catechole site should react with osmium, to make Os- black. Phenol-site should react with peroxidase existing perhydroxide.

Processing Immunoperoxidase Labeled Cell Monolayers and Cryostat Sesctions For Electron Microscopy

1985 ◽  
Vol 43 ◽  
pp. 714-715
Author(s):  
K. Chien ◽  
R. Van de Velde ◽  
I.P. Shintaku ◽  
A.F. Sassoon
Keyword(s):  
Cell Monolayer ◽  
Cell Types ◽  
Surface Antigens ◽  
Immunoperoxidase Method ◽  
Reaction Step ◽  
Hot Plate ◽  
Air Drying ◽  
New Approach ◽  
Cell Monolayers ◽  
Glass Slides

Immunoelectron microscopy of neoplastic lymphoma cells is valuable for precise localization of surface antigens and identification of cell types. We have developed a new approach in which the immunohistochemical staining can be evaluated prior to embedding for EM and desired area subsequently selected for ultrathin sectioning.A freshly prepared lymphoma cell suspension is spun onto polylysine hydrobromide- coated glass slides by cytocentrifugation and immediately fixed without air drying in polylysine paraformaldehyde (PLP) fixative. After rinsing in PBS, slides are stained by a 3-step immunoperoxidase method. Cell monolayer is then fixed in buffered 3% glutaraldehyde prior to DAB reaction. After the DAB reaction step, wet monolayers can be examined under LM for presence of brown reaction product and selected monolayers then processed by routine methods for EM and embedded with the Chien Re-embedding Mold. After the polymerization, the epoxy blocks are easily separated from the glass slides by heatingon a 100°C hot plate for 20 seconds.

Sign in / Sign up

Export Citation Format

Share Document