Efficient Computation of Distance Labeling for Decremental Updates in Large Dynamic Graphs

World Wide Web - United States
doi 10.1007/s11280-016-0421-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

XML Labeling Schemes for Dynamic Updates: Strengths and Limitations

International Journal on Advanced Science, Engineering and Information Technology
AgriculturalEngineeringComputer ScienceBiological Sciences
2011English

Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs

Proceedings - Design Automation Conference
ControlSystems EngineeringElectronic EngineeringSimulationHardwareComputer Science ApplicationsElectricalArchitectureModeling
2007English

Efficient Distance Computation Using Best Ellipsoid Fit

English

Diameter Computation on H-Minor Free Graphs and Graphs of Bounded (Distance) VC-dimension

2020English

Dynamic Distance Hereditary Graphs Using Split Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

An I/O-Efficient Distance Oracle for Evolving Real-World Graphs

2014English

Managing Large Distributed Dynamic Graphs for Smart City Network Applications

Applied Network Science
Computational MathematicsCommunicationsMultidisciplinaryComputer Networks
2019English

Square Multiplicative Labeling for Some Graphs

International Journal of Scientific and Innovative Mathematical Research
2016English

Square Difference Labeling for Some Graphs

International Journal of Computer Applications
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy