Results 51 to 60 of about 166,315,972 (73)

A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set

open access: yesLecture Notes in Computer Science, 2003
Colloque avec actes et comité de lecture. internationale.International audienceThe ``Lexicographically First Maximal Independent Set Problem'' on graphs with bounded degree 3 is at most sqrt(n)-complete, and thus very likely not parallelizable in a fine ...
Jan Arne Telle, Jens Gustedt
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Quantum Algorithm for Lexicographically Minimal String Rotation

Theory of Computing Systems, 2023
Qisheng Wang, Mingsheng Ying
exaly  

Lexicographically optimal earliest arrival flows

Networks, 2020
Naoyuki Kamiyama
exaly  

Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector

Mathematics of Operations Research, 1980
Satoru Fujishige
exaly  

Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector

Journal of Information and Optimization Sciences, 1995
Kakuzo Iwamura
exaly  

Home - About - Disclaimer - Privacy