Sciweavers

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

36

DISOPT
2011

favoriteEmaildiscussreport

213views Education» more DISOPT 2011»

On the algorithmic effectiveness of digraph decompositions and complexity measures

13 years 5 months ago

On the algorithmic effectiveness of digraph decompositions and complexity measures

Download web.cs.gc.cuny.edu

Michael Lampis, Georgia Kaouri, Valia Mitsou

Real-time Traffic

DISOPT 2011 | Education |

claim paper

Related Content

» Digraph measures Kelly decompositions games and orderings

» A LogSpace Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

» Low complexity H263 to H264 video transcoding using motion vector decomposition

» Measuring Software Functional Size Towards an Effective Measurement of Complexity

» Effective Decompositioning of Complex Spatial Objects into Intervals

» Shape Measure for Identifying Perceptually Informative Parts of 3D Objects

» The size distribution for Markov equivalence classes of acyclic digraph models

» Path Decomposition Under a New Cost Measure with Applications to Optical Network Design

» A new enhanced constructive decomposition and mapping algorithm

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	DISOPT
Authors	Michael Lampis, Georgia Kaouri, Valia Mitsou

Comments (0)