Finding a maximum matching in a permutation graph

1995 ◽  
Vol 32 (8) ◽  
pp. 779-792 ◽  
Author(s):  
Chongkye Rhee ◽  
Y. Daniel Liang
Keyword(s):  
Maximum Matching ◽  
Permutation Graph

Finding a maximum matching in a permutation graph

1995 ◽  
Vol 32 (8) ◽  
pp. 779-792
Author(s):  
Chongkye Rhee ◽  
Y. Daniel Liang
Keyword(s):  
Maximum Matching ◽  
Permutation Graph

scholarly journals Recovery of disrupted airline operations using k-Maximum Matching in graphs

2017 ◽  
Vol 62 ◽  
pp. 3-8 ◽  
Author(s):  
Julien Bensmail ◽  
Valentin Garnero ◽  
Nicolas Nisse ◽  
Alexandre Salch ◽  
Valentin Weber
Keyword(s):  
Maximum Matching ◽  
Airline Operations

Maximum Matching

2008 ◽  
pp. 504-506
Author(s):  
Marcin Mucha
Keyword(s):  
Maximum Matching

The maximum matching degree sifting algorithm for steganography pretreatment applied to IoT

2017 ◽  
Vol 77 (14) ◽  
pp. 18203-18221 ◽  
Author(s):  
Huifeng Li ◽  
Liang Hu ◽  
Jianfeng Chu ◽  
Ling Chi ◽  
Hongtu Li
Keyword(s):  
Maximum Matching ◽  
Matching Degree

scholarly journals Communication Efficient Coresets for Maximum Matching

2021 ◽  
pp. 156-164
Author(s):  
Michael Kapralov ◽  
Gilbert Maystre ◽  
Jakab Tardos
Keyword(s):  
Maximum Matching

scholarly journals Upper bounds on the energy of graphs in terms of matching number

2021 ◽  
pp. 16-16
Author(s):  
Saieed Akbari ◽  
Abdullah Alazemi ◽  
Milica Andjelic
Keyword(s):  
Adjacency Matrix ◽  
Connected Graph ◽  
Short Proof ◽  
Upper Bounds ◽  
Vertex Degree ◽  
Maximum Matching ◽  
Matching Number ◽  
Open Problems

The energy of a graph G, ?(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. The matching number ?(G) is the number of edges in a maximum matching. In this paper, for a connected graph G of order n with largest vertex degree ? ? 6 we present two new upper bounds for the energy of a graph: ?(G) ? (n-1)?? and ?(G) ? 2?(G)??. The latter one improves recently obtained bound ?(G) ? {2?(G)?2?e + 1, if ?e is even; ?(G)(? a + 2?a + ?a-2?a), otherwise, where ?e stands for the largest edge degree and a = 2(?e + 1). We also present a short proof of this result and several open problems.

scholarly journals Approximate Maximum Matching in Random Streams

2020 ◽  
pp. 1773-1785
Author(s):  
Alireza Farhadi ◽  
Mohammad Taghi Hajiaghayi ◽  
Tung Mah ◽  
Anup Rao ◽  
Ryan A. Rossi
Keyword(s):  
Maximum Matching
Sign in / Sign up

Export Citation Format

Share Document