• Aucun résultat trouvé

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm"

Copied!
31
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Loading

Figure

Figure 1. Pivoting an edge ab.
Figure 2. The split decomposition D ˚ v ˚ w ˚ v, which is the same as D ^ vw.
Figure 4. The canonical decomposition of a graph of linear rank- rank-width 2. If we regard the marked vertices incident with vertices in the middle bag B as vertices of sub-decompositions after removing B, then each sub-decomposition corresponds to a grap
Figure 5. In paq, we have a canonical decomposition D of a distance-hereditary graph with a bag B

Références

Télécharger maintenant ( PDF - 31 Page - 516.83 KB )

Documents relatifs

Linear Time Recognition of P4-Indifference Graphs

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rh ˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT

Several notions of rank-width for countable graphs

A more natural notion of rank-width based on countable cubic trees (we call it discrete rank-width) has a weaker type of compactness: the corresponding width is at most twice the

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs

As a new attempt in this direction, our initial motivation for this paper was to design a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

It is trivial to conclude that since Compute Label computes correctly the label of the whole rooted cactus (Lemma 5), Longest Cactus computes the length of a longest path in it..

Chronic Stress Alters Striosome-Circuit Dynamics, Leading to Aberrant Decision-Making

In the stressed rats, we detected more pairs of PFC-PLs neurons and SPNs with significant short-time interaction starting immediately after PFC-PL burst (control: 2/30,

Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks

Checkout DV-hop algorithm estimates the mobile node position by using the nearest anchor, while Selective 3-Anchor DV-hop algorithm chooses the best 3 anchors to improve

Adjoint accuracy for the full-Stokes ice flow model: limits to the transmission of basal friction variability to the surface

The “self-adjoint” approximation for the full-Stokes problem is detailed in terms of equations and presented as a limited case of the reverse accumulation method used to compute

Prevalence of chronic pain with neuropathic characteristics in the general population.

This is also supported by our estimated proportion of chronic pain sufferers with neuropathic characteristics in the general population (25 of sufferers of chronic pain of at