Item request has been placed!

Item request cannot be made.

Processing Request

نتائج البحث

Display Settings

النتائج لكل صفحة: 10

Sort By: Relevance

فلترة النتائج

Content Provider : OpenAIRE Publication : theoretical computer science Subject : 020201 artificial intelligence & image processing Subject : combinatorics فلترة بواسطة : موضوع

إعادة تعيين خيارات الفبترة

Item request has been placed!

Item request cannot be made.

Processing Request

NP-completeness results for partitioning a graph into total dominating sets

Authors : Mikko Koivisto; Petteri Laakkonen; Juho Lauri ...

Subjects: Vertex (graph theory); Domatic number; General Computer Science

Source: Lecture Notes in Computer Science ISBN: 9783319623887COCOON

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words

Authors : Narad Rampersad; Morteza Mohammad-Noori; Marieh Jahannia

Subjects: Combinatorics; Variation (linguistics); General Computer Science

Source: Theoretical Computer Science. 790:16-40

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Minimum degree condition for proper connection number 2

Authors : Fei Huang; Colton Magnant; Xueliang Li

Subjects: Discrete mathematics; General Computer Science; Induced path

Source: Theoretical Computer Science. 774:44-50

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Degree constrained 2-partitions of semicomplete digraphs

Authors : Tilde My Christiansen; Jørgen Bang-Jensen

Subjects: Semicomplete digraph; General Computer Science; Minimum out-degree

Source: Bang-Jensen, J & Christiansen, T M 2018, ' Degree constrained 2-partitions of semicomplete digraphs ', Theoretical Computer Science, vol. 746, pp. 112-123 .

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Belief propagation for the maximum-weight independent set and minimum spanning tree problems

Authors : Bodo Manthey; Kamiel Cornelissen; Discrete Mathematics and Mathematical Programming

Subjects: 021103 operations research; General Computer Science; Heuristic

Source: Theoretical computer science, 738, 53-64. Elsevier

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

On the kernelization of split graph problems

Authors : Yash Raj Shrestha; Yongjie Yang; Wenjun Li

Subjects: Discrete mathematics; General Computer Science; 020206 networking & telecommunications

Source: Theoretical Computer Science. 734:72-82

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes

Authors : Pingshan Li; Qi Cheng; Min Xu

Subjects: Physics; General Computer Science; 020206 networking & telecommunications

Source: Theoretical Computer Science. 728:1-8

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices

Authors : Adrian Atanasiu; Ghajendran Poovanandran; Wen Chean Teh

Subjects: Conjecture; General Computer Science; 020206 networking & telecommunications

Source: Theoretical Computer Science. 719:86-93

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes

Authors : Pingshan Li; Min Xu

Subjects: Discrete mathematics; General Computer Science; 020206 networking & telecommunications

Source: Theoretical Computer Science. 707:56-68

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Locally identifying coloring of graphs with few P4s

Authors : Rudini Menezes Sampaio; Nícolas A. Martins

Subjects: Physics::Computational Physics; Discrete mathematics; General Computer Science

Source: Theoretical Computer Science. 707:69-76

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي