A Shortest Cycle for Each Vertex of a Graph

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2011.07.019
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Computational Comparison of Two Methods for Finding the Shortest Complete Cycle or Circuit in a Graph

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
1981English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

Shortest Path Estimation for Graph Data Using a Relational Technique

International Journal of Database Management Systems
2015English

A Shortest-Path Graph Kernel for Estimating Gene Product Semantic Similarity

Journal of Biomedical Semantics
Computer NetworksComputer Science ApplicationsHealth InformaticsInformation SystemsCommunications
2011English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

From "Think Like a Vertex" to "Think Like a Graph"

Proceedings of the VLDB Endowment
Computer Science
2013English

Limit Distributions of Vertex Degrees in a Conditional Configuration Graph

Proceedings of the Karelian Research Centre of the Russian Academy of Sciences
2018English

The Forcing Edge-To-Vertex Geodetic Number of a Graph

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2015English

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy