Signsolvability revisited (Q795898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127186335, #quickstatements; #temporary_batch_1723632976074
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Richard E. Ladner / rank
Normal rank
 
Property / author
 
Property / author: Richard E. Ladner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(84)90164-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205437167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative Economics and the Scope of the Correspondence Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing sign solvable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to detect balance in signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Qualitatively Determinate Relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical approach to qualitative solvability of linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative Problems in Matrix Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Predator-Prey Oscillations in Ecological and Economic Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search strategy for the elementary cycles of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycles in directed graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127186335 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 14 August 2024

scientific article
Language Label Description Also known as
English
Signsolvability revisited
scientific article

    Statements

    Signsolvability revisited (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    sign-solvability
    0 references
    sign pattern
    0 references
    L-matrices
    0 references
    S-matrices
    0 references
    NP-complete
    0 references

    Identifiers