An efficient algorithm for computing permanental polynomials of graphs (Q710005): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4800134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the permanental polynomials of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of the permanent of a sparse positive matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for computing permanents of sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Vandermonde systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank

Latest revision as of 09:07, 3 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for computing permanental polynomials of graphs
scientific article

    Statements

    An efficient algorithm for computing permanental polynomials of graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    permanental polynomial
    0 references
    adjacency matrix
    0 references
    graph
    0 references
    fullerene
    0 references
    FFT
    0 references

    Identifiers