Sciweavers

966 search results - page 6 / 194
» Small Alliances in Graphs
Sort
View
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
14 years 2 months ago
Small Stretch Spanners on Dynamic Graphs
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 6 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
COMPGEOM
2007
ACM
14 years 15 days ago
Embedding 3-polytopes on a small grid
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Ares Ribó Mor, Günter Rote, Andr&eacut...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
AML
2010
98views more  AML 2010»
13 years 8 months ago
Small universal families for graphs omitting cliques without GCH
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
Katherine Thompson