Amanote Research

Amanote Research

    RegisterSign In

On the Longest Path in a Recursively Partitionable Graph

Opuscula Mathematica - Poland
doi 10.7494/opmath.2013.33.4.631
Full Text
Open PDF
Abstract

Available in full text

Categories
Mathematics
Date

January 1, 2013

Authors
Julien Bensmail
Publisher

AGHU University of Science and Technology Press


Related search

On Locating a Single Path-Like Facility in a General Graph

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

A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem

Frontiers in Genetics
GeneticsMolecular Medicine
2017English

Investigations on Path Indexing for Graph Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Expressive Path Queries on Graph With Data

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

Path-Augmented Graph Transformer Network

2019English

Path-Augmented Graph Transformer Network

2019English

On Recursively Defined Orthogonal Polynomials

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Genetic Algorithms for Estimating Longest Path From Inherently Fuzzy Data Acquired With GPS

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy