Pages that link to "Item:Q3521928"

The following pages link to Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (Q3521928):

Displaying 19 items.

• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• Distance three labelings of trees (Q415278) (← links)
• Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
• Injective colorings with arithmetic constraints (Q897262) (← links)
• On the complexity of labeled oriented trees (Q968053) (← links)
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
• Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
• Computational complexity of distance edge labeling (Q1647838) (← links)
• On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
• The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
• A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
• Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
• Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes (Q3523216) (← links)
• Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
• The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)