Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Stavros D. Nikolopoulos"'
Publikováno v:
Algorithms, Vol 16, Iss 6, p 289 (2023)
Consider a graph G which belongs to a graph class C. We are interested in connecting a node w∉V(G) to G by a single edge uw where u∈V(G); we call such an edge a tail. As the graph resulting from G after the addition of the tail, denoted G+uw, nee
Externí odkaz:
https://doaj.org/article/4b9e67c5081e4aaab564832af2f66953
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://doaj.org/article/4a4fb90d18954eb29694e3eac3200c9c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
The K n-complement of a graph G, denoted by K n-G, is defined as the graph obtained from the complete graph K n by removing a set of edges that span G; if G has n vertices, then K n-G coincides with the complement G of the graph G. In this paper we e
Externí odkaz:
https://doaj.org/article/b169537b03f94ef6a2c97a96b7408def
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 7, Iss 1 (2005)
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced by Hoàng and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms HR1. In this paper, we consider th
Externí odkaz:
https://doaj.org/article/dfab5002c8d54fbeb91b0ebd5c1bd64b
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 7 (2005)
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Hoàng and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms HR1. In this paper, we consider th
Externí odkaz:
https://doaj.org/article/c2c5d6048f0f41f2a61d0c4b6e2f73ba
Publikováno v:
Journal of Computer Security. 31:107-128
Software watermarking is a defense technique used to prevent or discourage software piracy by embedding a signature in the code. In (Discrete Applied Mathematics 250 (2018) 145–164), a software watermarking system is presented which encodes an inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb7039f5e669382e4c1549900f1ba170
https://doi.org/10.3233/jcs-210048
https://doi.org/10.3233/jcs-210048
Publikováno v:
Algorithms; Volume 16; Issue 6; Pages: 289
Consider a graph G which belongs to a graph class C. We are interested in connecting a node w∉V(G) to G by a single edge uw where u∈V(G); we call such an edge a tail. As the graph resulting from G after the addition of the tail, denoted G+uw, nee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::de45b4e920d4adf0a378e2159b720903
Publikováno v:
Journal of Computer Virology and Hacking Techniques. 18:383-406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1cd8a605de3411993f3fd624589d9bd
https://doi.org/10.1007/s11416-022-00423-4
https://doi.org/10.1007/s11416-022-00423-4
Publikováno v:
Journal of Computer Virology and Hacking Techniques. 19:97-123
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5e8d474a52ff5cba1f4eb7a43902a8a
https://doi.org/10.1007/s11416-022-00433-2
https://doi.org/10.1007/s11416-022-00433-2
Publikováno v:
Journal of Computer Security. 29:651-688
In this paper we present a graph-based framework that, utilizing relations between groups of System-calls, detects whether an unknown software sample is malicious or benign, and classifies a malicious software to one of a set of known malware familie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2c13cf4bb632c403149e84e9171f325
https://doi.org/10.3233/jcs-210057
https://doi.org/10.3233/jcs-210057