Optimal Numberings of an $N \times N$ Array (Q4726293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1137/0607063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1495595412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of mean-square error for data transmitted via group codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary condition on minimal cube numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:33, 17 June 2024

scientific article; zbMATH DE number 3999986
Language Label Description Also known as
English
Optimal Numberings of an $N \times N$ Array
scientific article; zbMATH DE number 3999986

    Statements

    Identifiers