On the use of graphs in discrete tomography (Q5900894): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2020370390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP flow model for crop-rotation planning in a context of forest sustainable development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5434308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5434304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5434309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph coloring problem arising from discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-constrained edge partitioning in graphs arising from discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of binary matrices under fixed size neighborhood constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using graphs for some discrete tomography problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of image reconstruction in discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of graphs in discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: IWCIA 2003. Selected papers based on the presentation at the 9th international workshop on combinatorial image analysis, Palermo, Italy, May 14--16, 2003. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank

Latest revision as of 20:14, 2 July 2024

scientific article; zbMATH DE number 5706060
Language Label Description Also known as
English
On the use of graphs in discrete tomography
scientific article; zbMATH DE number 5706060

    Statements

    On the use of graphs in discrete tomography (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete tomography
    0 references
    complete bipartite graph
    0 references
    edge coloring
    0 references
    timetabling
    0 references
    constrained coloring
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references