NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-16042-6_28 ◽

1985 ◽

pp. 496-503 ◽

Author(s):

Dexter Kozen ◽

Umesh V. Vazirani ◽

Vijay V. Vazirani

Keyword(s):

Perfect Matching ◽

Interval Graphs ◽

Download Full-text

NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

SIAM Journal on Computing ◽

10.1137/19m1256221 ◽

2021 ◽

Vol 50 (3) ◽

pp. 1014-1033

Author(s):

David Eppstein ◽

Vijay V. Vazirani

Keyword(s):

Perfect Matching ◽

Maximum Flow ◽

Minor Free Graphs ◽

Download Full-text

NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs

IEEE Proceedings of the SOUTHEASTCON '91 ◽

10.1109/secon.1991.147822 ◽

2002 ◽

Author(s):

Y. Liang ◽

C. Rhee ◽

S.K. Dhall ◽

S. Lakshmivarahan

Keyword(s):

Interval Graphs ◽

Search Trees ◽

Circular Arc ◽

Depth First Search ◽

Circular Arc Graphs ◽

Depth First Search Trees ◽

Download Full-text

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs

The 31st ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '19 ◽

10.1145/3323165.3323206 ◽

2019 ◽

Author(s):

David Eppstein ◽

Vijay V. Vazirani

Keyword(s):

Perfect Matching ◽

Maximum Flow ◽

Perfect Matchings ◽

Minor Free Graphs ◽

Download Full-text

An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs

Electronic Notes in Discrete Mathematics ◽

10.1016/s1571-0653(05)00749-3 ◽

2000 ◽

Vol 3 ◽

pp. 1-4

Author(s):

J LAKHAL ◽

L LITZLER

Keyword(s):

Perfect Matching ◽

Matching Problem

Download Full-text

Representation of certain self-similar quasiperiodic tilings with perfect matching rules by discrete point sets

Journal de Physique I ◽

10.1051/jp1:1994234 ◽

1994 ◽

Vol 4 (6) ◽

pp. 893-904 ◽

Author(s):

Richard Klitzing ◽

Michael Baake

Keyword(s):

Perfect Matching ◽

Discrete Point ◽

Self Similar ◽

Matching Rules ◽

Quasiperiodic Tilings

Download Full-text

Perfect matching layer for Haar wavelet based multi-resolution time-domain technique

IET 7th International Conference on Computation in Electromagnetics (CEM 2008) ◽

10.1049/cp:20080243 ◽

2008 ◽

Author(s):

Xiaojing Wang ◽

Yang Hao ◽

Cho-Ho Chu

Keyword(s):

Time Domain ◽

Perfect Matching ◽

Haar Wavelet ◽

Resolution Time ◽

Download Full-text

Claw-free graphs. III. Circular interval graphs

Journal of Combinatorial Theory Series B ◽

10.1016/j.jctb.2008.03.001 ◽

2008 ◽

Vol 98 (4) ◽

pp. 812-834 ◽

Author(s):

Maria Chudnovsky ◽

Paul Seymour

Keyword(s):

Interval Graphs

Download Full-text

Computing the branchwidth of interval graphs

Discrete Applied Mathematics ◽

10.1016/j.dam.2004.01.015 ◽

2005 ◽

Vol 145 (2) ◽

pp. 266-275 ◽

Author(s):

Ton Kloks ◽

Jan Kratochvíl ◽

Haiko Müller

Keyword(s):

Interval Graphs

Download Full-text

A sufficient condition for the unpaired k-disjoint path coverability of interval graphs

The Journal of Supercomputing ◽

10.1007/s11227-020-03512-7 ◽

2021 ◽

Author(s):

Jung-Heum Park

Keyword(s):

Interval Graphs ◽

Disjoint Path ◽

Sufficient Condition

Download Full-text

On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching

Discrete Applied Mathematics ◽

10.1016/j.dam.2021.05.009 ◽

2021 ◽

Vol 301 ◽

pp. 19-25

Author(s):

Giuseppe Mazzuoccolo ◽

Lorenzo Mella

Keyword(s):

Perfect Matching ◽

Download Full-text