3267 search results - page 96 / 654 » Generalized quasirandom graphs |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
GG
2008
Springer
15 years 8 days ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
WWW
2004
ACM
15 years 12 months ago
2004
ACM
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
110
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
117
click to vote
AVI
2006
15 years 18 days ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...