Skip to content
Log in
Sponsored AI Networking Cookbook: Practical recipes for AI-assisted network automation and development AI Networking Cookbook: Practical recipes for AI-assisted network automation and development

Author

Avraham Kreindel

View on Semantic Scholar

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#software testing Open access Sep 2026

Exact verification for consecutive optimal components in 2-club cluster edge deletion on proper interval graphs

This software deposit contains a deterministic standard-library Python verifier and reproduction instructions for consecutive optimal components in unweighted 2-Club Cluster Edge Deletion on proper interval graphs. It includes no manuscript, precomputed result records, external datasets, or certificate archive. The software generates the finite graph inputs and can generate result records and regression certificates when executed. The full computation enumerates 23,712 fixed-order umbrella representations through ten vertices, compares distinct optimization paths through eight vertices, and tests the endpoint-reach criterion. These finite checks are diagnostic evidence and do not replace the mathematical proof. The optimization paths share graph generation, low-level helpers, and final validators. Python 3.12 or later is recommended. The package documents a quick smoke test and the full exact run, with no third-party dependencies or external input downloads.

Avraham Kreindel, Lev Yohananov · 0 citations
#software testing Open access Sep 2026

Exact verification for consecutive optimal components in 2-club cluster edge deletion on proper interval graphs

This software deposit contains a deterministic standard-library Python verifier and reproduction instructions for consecutive optimal components in unweighted 2-Club Cluster Edge Deletion on proper interval graphs. It includes no manuscript, precomputed result records, external datasets, or certificate archive. The software generates the finite graph inputs and can generate result records and regression certificates when executed. The full computation enumerates 23,712 fixed-order umbrella representations through ten vertices, compares distinct optimization paths through eight vertices, and tests the endpoint-reach criterion. These finite checks are diagnostic evidence and do not replace the mathematical proof. The optimization paths share graph generation, low-level helpers, and final validators. Python 3.12 or later is recommended. The package documents a quick smoke test and the full exact run, with no third-party dependencies or external input downloads.

Avraham Kreindel, Lev Yohananov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.