𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation

✍ Scribed by Stavros D. Nikolopoulos; Leonidas Palios

Publisher
Springer
Year
2004
Tongue
English
Weight
413 KB
Volume
39
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An O(n) time algorithm for maximum match
An O(n) time algorithm for maximum matching in P4-tidy graphs
✍ J.L. Fouquet; I. Parfenoff; H. Thuillier πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 630 KB

The A-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with "few" induced P4 s. In this paper, we extend to PA-tidy graphs a linear time algorithm of C.-H. Yang and M.-S. Yu for finding a maximum matching in a cograph G (given a parse tree associated to G). @

SIMPLE MAX-CUT for unit interval graphs
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
✍ Hans L. Bodlaender; Ton Kloks; Rolf Niedermeier πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 56 KB

The SIMPLE MAX-CUT problem can be solved in linear time for unit interval graphs. We show also that for each constant q, the SIMPLE MAX-CUT problem can be solved in polynomial time for (q, q -4)-graphs.

Experimental transition probabilities fo
Experimental transition probabilities for lines arising from the 4d5p and 4d5d configurations of ZrIII
✍ R. Mayo; M. Ortiz; J. Campos πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 204 KB

Relative transition probabilities for 120 lines arising from the 4d5p and 4d5d configurations of ZrIII were determined from measurements of emission-line intensities in a laser-produced plasma. The experiment was carried out with Cu-Zr alloy with a Zr content lower than 13% in order to have an optic