| Document Date: 2013-07-31 02:53:24
Open Document File Size: 2,60 MBShare Result on Facebook
Company Json.NET / Intel / Microsoft / / / Event Company Expansion / / Facility Visual Studio / Json.NET library / Wiley Online Library / Monash University / / IndustryTerm software-engineering diagrams / code-dependency analysis tool / software engineering / software dependency analysis / online repository / software frameworks / symmetric solutions / protein networks / biological systems / experiment software / Online Library / gene regulatory networks / polynomial-time algorithm / experimental software / power-graph solutions / software dependency graph / compressed solutions / approximate solutions / n2 divide-and-conquer algorithm / software dependency visualization feature / trivial systems / biological reaction networks / / Organization National Academy of Sciences / Society for Industrial and Applied Mathematics / Monash University / / Person Tim Dwyer / B. Andreopoulos / M. Schroeder / Christopher Mears / M. Reimann / Kim Marriott / Nathalie Henry Riche / L. Royer / / Product Friedman / Visual Studio / Microsoft Visual Studio / / ProgrammingLanguage Python / IronPython / / ProvinceOrState South Carolina / / PublishedMedium Proceedings of the National Academy of Sciences / Computer Graphics / / Technology n2 divide-and-conquer algorithm / same training protocol / polynomial-time algorithm / / URL www.heikniemi.net/hardcoded/2011/10 / http /
SocialTag |
Edge Compression Techniques for Visualization of Dense Directed Graphs Tim Dwyer, Nathalie Henry Riche, Kim Marriott, Christopher Mears (c) A Modular Decomposition allows internal structure within modules and nesting. Ni