Merev körű kiegészítés (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Merev körű kiegészítés" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

1livejournal.com

552^nd place

1,209^th place

1web.archive.org

1^st place

doi.org

dx.doi.org

Parra, Andreas & Scheffler, Petra (1997), "Characterizations and algorithmic applications of chordal graph embeddings", Discrete Applied Mathematics 79 (1-3): 171–188, DOI 10.1016/S0166-218X(97)00041-3.
Kaplan, Haim & Shamir, Ron (1996), "Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques", SIAM Journal on Computing 25 (3): 540–561, DOI 10.1137/S0097539793258143.
Chung, F. R. K. & Mumford, David (1994), "Chordal completions of planar graphs", Journal of Combinatorial Theory, Series B 62 (1): 96–106, DOI 10.1006/jctb.1994.1056.
Buneman, Peter (1974), "A characterisation of rigid circuit graphs", Discrete Mathematics 9: 205–212, DOI 10.1016/0012-365X(74)90002-8.
Yannakakis, Mihalis (1981), "Computing the minimum fill-in is NP-complete", Society for Industrial and Applied Mathematics 2 (1): 77–79, DOI 10.1137/0602010.
Natanzon, Assaf; Shamir, Ron & Sharan, Roded (2000), "A polynomial approximation algorithm for the minimum fill-in problem", SIAM Journal on Computing 30 (4): 1067–1079, DOI 10.1137/S0097539798336073.
Fomin, Fedor V. & Villanger, Yngve (2013), "Subexponential parameterized algorithm for minimum fill-in", SIAM Journal on Computing 42 (6): 2197–2216, DOI 10.1137/11085390X.
Bodlaender, Hans L.; Gilbert, John R. & Hafsteinsson, Hjálmtýr et al. (1995), "Approximating treewidth, pathwidth, frontsize, and shortest elimination tree", Journal of Algorithms 18 (2): 238–255, DOI 10.1006/jagm.1995.1009.
Fomin, Fedor V.; Kratsch, Dieter & Todinca, Ioan (2004), "Exact (exponential) algorithms for treewidth and minimum fill-In", Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings, vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, pp. 568–580, DOI 10.1007/978-3-540-27836-8_49.

livejournal.com

11011110.livejournal.com

Eppstein, David (November 15, 2012), Graph parameters and cliques in supergraphs, <http://11011110.livejournal.com/258705.html>. Hozzáférés ideje: 2017-03-29 Archiválva 2014. január 9-i dátummal a Wayback Machine-ben Archivált másolat. [2014. január 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. március 29.).

web.archive.org

Eppstein, David (November 15, 2012), Graph parameters and cliques in supergraphs, <http://11011110.livejournal.com/258705.html>. Hozzáférés ideje: 2017-03-29 Archiválva 2014. január 9-i dátummal a Wayback Machine-ben Archivált másolat. [2014. január 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. március 29.).