Computing role assignments of proper interval graphs in polynomial time (Q450561): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Pim van 't Hof / rank
Normal rank
 
Property / author
 
Property / author: Pim van 't Hof / rank
Normal rank
 
Property / author
 
Property / author: Pim van 't Hof / 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/j.jda.2011.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021148840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Labelings Derived from Models in Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete complexity classification of the role assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing universal covers in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique-separator graph for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of independent sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role assignment model nearly fits most social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-role assignments on triangulated graphs. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Computing role assignments of proper interval graphs in polynomial time
scientific article

    Statements

    Computing role assignments of proper interval graphs in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    0 references
    Role Assignment
    0 references
    locally surjective homomorphism
    0 references
    proper interval graph
    0 references
    0 references