NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0890-5401(89)90017-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022124805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to the subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on primitive skew curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu Hadwigers Vermutung / rank
 
Normal rank

Latest revision as of 14:23, 19 June 2024

scientific article
Language Label Description Also known as
English
NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
scientific article

    Statements

    Identifiers