Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

Voted

STOC
2006
ACM

favoriteEmaildiscussreport

106views Algorithms» more STOC 2006»

Finding small balanced separators

16 years 15 days ago

Finding small balanced separators

Download research.microsoft.com

Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller

Uriel Feige, Mohammad Mahdian

Real-time Traffic

Algorithms | STOC 2006 | Vertex Separator |

claim paper

Related Content

» Separatorbased data reduction for signed graph balancing

» Selecting normalization genes for small diagnostic microarrays

» Optimal Edge Deletions for Signed Graph Balancing

» Formal Modelling of Separation Kernel Components

» A TwoLevel Approach Towards Semantic Colon Segmentation Removing ExtraColonic Findings

» Finding Composite Episodes

» Social search in SmallWorld experiments

» Sharp Separation and Applications to Exact and Parameterized Algorithms

» Separability and Topology Control of Quasi Unit Disk Graphs

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Uriel Feige, Mohammad Mahdian

Comments (0)