Graph fibrations, graph isomorphism, and PageRank (Q3431437): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: WebGraph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148357992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paradoxical Effects in PageRank Incremental Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibrations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph in \(O(|A|\log_ 2|V|)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5637011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-to-one and onto global maps of homomorphisms between strongly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory and finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874718 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:01, 25 June 2024

scientific article
Language Label Description Also known as
English
Graph fibrations, graph isomorphism, and PageRank
scientific article

    Statements

    Graph fibrations, graph isomorphism, and PageRank (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 April 2007
    0 references
    graph fibrations
    0 references
    PageRank
    0 references
    Markov chain with restart
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references