Time and Space Efficient Discovery of Maximal Geometric Graphs

doi 10.1007/978-3-540-75488-6_6
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

The Cover Time of Random Geometric Graphs

2009English

Space-Efficient Counting in Graphs on Surfaces

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2009English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Bidimensionality and Geometric Graphs

2012English

Time-Varying Reeb Graphs for Continuous Space–time Data

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2008English

Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space

International Journal of Advanced Computer Science and Applications
Computer Science
2020English

Time-Efficient and Cost-Effective Network Hardening Using Attack Graphs

2012English

Note on Geometric Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Maximal-Clique Partitions of Interval Graphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy