1648 search results - page 122 / 330 » On the generation of bicliques of a graph |
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
137
click to vote
COMCOM
2008
15 years 11 days ago
2008
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...
135
Voted
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
132
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
100
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...