Search Sciweavers | Sciweavers

760 search results - page 4 / 152

» Algorithms for finding clique-transversals of graphs

click to vote

CORR
2010
Springer

156views Education» more CORR 2010»

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set

13 years 7 months ago

Download www.cs.sfu.ca

A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...

Serge Gaspers, Mathieu Liedloff

claim paper

Read More »

click to vote

WAW
2010
Springer

306views Algorithms» more WAW 2010»

Finding and Visualizing Graph Clusters Using PageRank Optimization

13 years 5 months ago

Download www.math.ucsd.edu

We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...

Fan Chung Graham, Alexander Tsiatas

claim paper

Read More »

click to vote

COCOON
2007
Springer

87views Combinatorics» more COCOON 2007»

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

14 years 1 months ago

Download www.cs.tau.ac.il

Noga Alon, Shai Gutner

claim paper

Read More »