927 search results - page 37 / 186 » Detection of Simple Plagiarism in Computer Science Papers |
114
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Individuals in social networks are often organized under some hierarchy such as a command structure. In many cases, when this structure is unknown, there is a need to discover h...
140
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
118
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
128
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
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 partic...
106
click to vote
SPIN
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking distributed systems with several instances of t...