ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “complete graph”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
math.COcs.CCTheoreticalRecentJul 21, 2026

Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness

William Whistler

This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.

View →
math.COcs.CCTheoreticalRecentJun 19, 2026

Conformability is NP-complete, even on connected regular graphs

József Pintér

The authors prove that Conformability is NP-complete, settling the complexity of the problem.

View →
cs.CCcs.DMTheoreticalRecentJul 10, 2026

Closing the Complexity Gap for Exact Domatic Number at Three and Four

Holger Spakowski

This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

View →
cs.CCTheoreticalRecentJul 24, 2026

Ice Walk is ASP-Complete

Papangkorn Apinyanon

The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…

View →
cs.CCcs.DMTheoreticalRecentSep 23, 2026

Lettericity Is NP-Complete

Henning Fernau, Samuel German, Kevin Mann

The authors prove that the lettericity problem on arbitrary graphs is NP-complete.

View →
cs.CCcs.CGTheoreticalRecentOct 22, 2026

Two-colour crossing minimization in complete geometric graphs is NP-hard

Zhe Zhang

The paper proves that the threshold decision problem for minimizing monochromatic crossing pairs in a graph is NP-complete.

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
cs.DMmath.COTheoreticalRecentAug 11, 2026

How Difficult Is It to Recognize CIS Graphs?

Rongchuan Tao, Mengxi Yang, Wenan Zang

This paper shows that recognizing CIS graphs is coNP-complete.

View →
math.COcs.DMTheoreticalRecentJun 25, 2026

Totally Disjoint Diametral Paths

Tınaz Ekim, Arthur Farley

This paper studies the problem of finding totally disjoint diametral paths in simple connected graphs and provides algorithms for certain classes of graphs.

View →
cs.DMcs.DSTheoreticalRecentJun 22, 2026

Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph Generalizations

Martin Darmüntzel, Christian Rosenke, Mark Scheibner

This paper studies the complexity of the Flood-It game on various graph classes and provides polynomial-time algorithms for Free Flood-It on graphs free of certain jewels, while proving NP-completenes…

View →
cs.DSTheoreticalRecentJun 16, 2026

Exact Algorithms for Edge Deletion to Cactus Graphs and Weighted Variants

Wenhao Song

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…

View →
cs.DMcs.DSEmpiricalRecentJun 11, 2026

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

Alexander Omelchenko

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
cs.DSmath.COTheoreticalRecentJul 28, 2026

Optimization of the directed spanning trees using the weighted matroid intersection algorithm

Binhong Jiang, Gehao Wang

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

View →
cs.CGcs.DMEmpiricalRecentJul 25, 2026

How to Draw a Planar Graph: An Experimental Evaluation

Sergey Pupyrev

This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.

View →
cs.DScs.DMTheoreticalRecentJun 29, 2026

Algorithms and complexity for geodetic sets on interval and chordal graphs

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat +1 more

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

View →