Sciweavers

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

11

WG
2005
Springer

favoriteEmaildiscussreport

144views Theoretical Computer Science» more WG 2005»

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny

13 years 10 months ago

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny

Download www.isima.fr

We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.

Anne Berry, Alain Sigayret, Jeremy Spinrad

Real-time Traffic

Chordal Graph | Computer Science | Current Complexities | WG 2005 |

claim paper

Related Content

» MasterSlave Biological Network Alignment

» Multicast Tree Diameter for Dynamic Distributed Interactive Applications

» Colibri fast mining of large static and dynamic graphs

» Constructing lowlatency overlay networks Tree vs mesh algorithms

» A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth

» Fast Matching of Planar Shapes in Subcubic Runtime

» Maintenance of Multilevel Overlay Graphs for Timetable Queries

» Active Graph Cuts

» Graphbased quadratic optimization A fast evolutionary approach

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Anne Berry, Alain Sigayret, Jeremy Spinrad

Comments (0)