Zobrazeno 1 - 10
of 32
pro vyhledávání: '"hhd-free"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Marina Moscarini, Mauro Mezzini
Publikováno v:
Discrete Applied Mathematics. 181:209-220
The eccentricity of a vertex vv in a graph GG is the maximum distance of vv from any other vertex of GG and vv is a contour vertex of GG if each vertex adjacent to vv has eccentricity not greater than the eccentricity of vv. The set of contour vertic
Publikováno v:
Discrete Applied Mathematics. 160:224-230
We show that the maximum induced matching problem can be solved on hhd-free graphs in O(m2) time; hhd-free graphs generalize chordal graphs and the previous best bound was O(m3). Then, we consider a technique used by Brandstädt and Hoàng (2008) [4]
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Victor Chepoi, Feodor F. Dragan
Publikováno v:
Discrete Applied Mathematics. 131(1):93-111
In a graph G=(V,E), the eccentricity e(v) of a vertex v is max{d(v,u):u∈V}. The center of a graph is the set of vertices with minimum eccentricity. A house–hole–domino-free (HHD-free) graph is a graph which does not contain the house, the domin
Autor:
Krishnamurthy, Chandra Mohan
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006
Autor:
Nikolopoulos, S. D., Palios, L.
In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10561::40c7415ae6ce8c00171b615693b326a7
http://olympias.lib.uoi.gr/jspui/handle/123456789/10914
http://olympias.lib.uoi.gr/jspui/handle/123456789/10914
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
In this paper, we consider the recognition problem on three classes of perfectly orderable graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af6bae180afd36e66cd44a3f2a26ab3b
https://doi.org/10.46298/dmtcs.370
https://doi.org/10.46298/dmtcs.370
Autor:
Nikolopoulos, S. D., Palios, L.
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(n(2) m)-time algorithm which determines w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10561::9f0a779e48284b6caf6b9325d28269df
http://olympias.lib.uoi.gr/jspui/handle/123456789/10862
http://olympias.lib.uoi.gr/jspui/handle/123456789/10862
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.