Maximum gap labelings of graphs - Feder, Tomás; Subi, Carlos (Information processing letters, 2011)
Keywords: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Approximation; Approximation algorithms; Approximations and expansions; Computer science; control theory; systems; Exact sciences and technology; Gaps; Graceful labelling of trees; Graph algorithms; Graph theory; Graphs; Information retrieval. Graph; Integers; Joints; Labeling; Marking; Mathematical analysis; Mathematics; Maximum gap in graph; Minimum edge deletion bipartition; Miscellaneous; Sciences and techniques of general use; Studies; Theoretical computing; Trees; Approximation algorithms; Graceful labelling of trees; Minimum edge deletion bipartition; Maximum gap in graph; Edge(graph); Computer theory; Polynomial approximation; Label; Approximation algorithm; Polynomial time; Assignment; Labelled graph; Integer; Gap problem; Input; Maximum; Information processing; Deletion; NP complete problem; Bipartite graph; Graph labelling; Algorithm analysis; Graph algorithm; Deterministic algorithms