2503 search results - page 273 / 501 » A study of 3-arc graphs |
212
click to vote
MST
2011
15 years 1 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
167
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
180
click to vote
RTAS
1998
IEEE
15 years 10 months ago
1998
IEEE
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
145
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
143
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...