Minimum Selective Subset on Unit Disk Graphs and Circle Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Manna, Bubai
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Geometry Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Minimum Selective Subset on Some Graph Classes
di: Manna, Bubai
Pubblicazione: (2025)

Minimum Consistent Subset in Interval Graphs and Circle Graphs
di: Manna, Bubai
Pubblicazione: (2024)

Minimum Strict Consistent Subset in Paths, Spiders, Combs and Trees
di: Manna, Bubai
Pubblicazione: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
di: Manna, Bubai, et al.
Pubblicazione: (2024)

Subcoloring of (Unit) Disk Graphs
di: Marin, Malory, et al.
Pubblicazione: (2025)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
di: Boomari, Hossein, et al.
Pubblicazione: (2018)

The Complexity of Drawing Graphs on Few Lines and Few Planes
di: Chaplick, Steven, et al.
Pubblicazione: (2016)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
di: Banik, Aritra, et al.
Pubblicazione: (2024)

Universal Solvability for Robot Motion Planning on Graphs
di: Dhar, Anubhav, et al.
Pubblicazione: (2025)

Recognizing 2-Layer and Outer $k$-Planar Graphs
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
di: Kupperschmitt, Maël, et al.
Pubblicazione: (2025)

Shortest Paths in Geodesic Unit-Disk Graphs
di: Brewer, Bruce W., et al.
Pubblicazione: (2026)

Counting Triangulations of Fixed Cardinal Degrees
di: Chambers, Erin, et al.
Pubblicazione: (2025)

Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
di: DeStefano, Zachary, et al.
Pubblicazione: (2025)

Query-Efficient Fixpoints of $\ell_p$-Contractions
di: Haslebacher, Sebastian, et al.
Pubblicazione: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
di: Gibor, Daniel
Pubblicazione: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
di: Silva, Lucas de Oliveira, et al.
Pubblicazione: (2025)

Realizing Metric Spaces with Convex Obstacles
di: Kisfaludi-Bak, Sándor, et al.
Pubblicazione: (2025)

On the complexity of embedding in graph products
di: Biedl, Therese, et al.
Pubblicazione: (2023)

Geometric Bipartite Matching is in NC
di: Bhore, Sujoy, et al.
Pubblicazione: (2024)

Complexity of 2D Snake Cube Puzzles
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

The Parameterized Complexity of Geometric 1-Planarity
di: Firbas, Alexander
Pubblicazione: (2026)

Constrained Boundary Labeling
di: Depian, Thomas, et al.
Pubblicazione: (2024)

On the hardness of finding normal surfaces
di: Burton, Benjamin A., et al.
Pubblicazione: (2019)

Pathways to Tractability for Geometric Thickness
di: Depian, Thomas, et al.
Pubblicazione: (2024)

On the complexity of covering points by guillotine cuts
di: Garijo, Delia, et al.
Pubblicazione: (2026)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
di: Derakhshan, Mahsa, et al.
Pubblicazione: (2025)

On $[1,2]$-Domination in Interval and Circle Graphs
di: Meybodi, Mohsen Alambardar, et al.
Pubblicazione: (2024)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
di: Nederlof, Jesper, et al.
Pubblicazione: (2023)

Undecidability of Translational Tiling with Three Tiles
di: Yang, Chan, et al.
Pubblicazione: (2024)

Translational Aperiodic Sets of 7 Polyominoes
di: Yang, Chao, et al.
Pubblicazione: (2024)

The Borsuk number of a graph
di: Cáceres, José, et al.
Pubblicazione: (2026)

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
di: Gan, Junhao, et al.
Pubblicazione: (2025)

Deterministic Depth-4 PIT and Normalization
di: Guo, Zeyu, et al.
Pubblicazione: (2025)

Improved Debordering of Waring Rank
di: Shpilka, Amir
Pubblicazione: (2025)

Simple Linear Loops: Algebraic Invariants and Applications
di: Manssour, Rida Ait El, et al.
Pubblicazione: (2024)

Generalized minimum 0-extension problem and discrete convexity
di: Dvorak, Martin, et al.
Pubblicazione: (2021)

Determination Problems for Orbit Closures and Matrix Groups
di: Manssour, Rida Ait El, et al.
Pubblicazione: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
di: Mu, Ta-Yu, et al.
Pubblicazione: (2024)

Finding Minimum Matching Cuts in $H$-free Graphs
di: Lucke, Felicia, et al.
Pubblicazione: (2025)

if (filemtime($filename) + $maxlifetime < time()) { unlink($filename); $count++; } } return $count; } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ protected function saveSession($sessId, $data): bool { $sessFile = $this->path . '/sess_' . $sessId; if ($handle = fopen($sessFile, 'w')) { $return = false; // Lock the file for exclusive access to avoid issues with multiple // processes writing session simultaneously: if (flock($handle, LOCK_EX)) { $return = fwrite($handle, $data); // Make sure that there's no trailing data by truncating the file to // the correct length: ftruncate($handle, strlen($data)); fflush($handle); flock($handle, LOCK_UN); } fclose($handle); if ($return !== false) { return true; } } // If we got this far, something went wrong with the file output... // It is tempting to throw an exception here, but this code is called // outside of the context of exception handling, so all we can do is // echo a message.

// Anecdotal testing Today and Yesterday seems to indicate destroy() // is called by the garbage collector and everything is good. // Something to keep in mind though. return 0; } /** * Write function that is called when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ public function write($sessId, $data): bool { if ($this->writesDisabled) { return true; } return $this->saveSession($sessId, $data); } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ abstract protected function saveSession($sessId, $data): bool; }

* * @return void */ public function writeClose() { // The assumption is that we're using PHP's ext/session. // session_write_close() will actually overwrite $_SESSION with an // empty array on completion -- which leads to a mismatch between what // is in the storage object and $_SESSION. To get around this, we // temporarily reset $_SESSION to an array, and then re-link it to // the storage object. // // Additionally, while you _can_ write to $_SESSION following a // session_write_close() operation, no changes made to it will be // flushed to the session handler. As such, we now mark the storage // object isImmutable. $storage = $this->getStorage(); if (! $storage->isImmutable()) { $_SESSION = $storage->toArray(true); session_write_close(); $storage->fromArray($_SESSION); $storage->markImmutable(); } } /** * Attempt to set the session name * * If the session has already been started, or if the name provided fails * validation, an exception will be raised. * * @param string $name * @return SessionManager * @throws Exception\InvalidArgumentException */ public function setName($name) { if ($this->sessionExists()) { throw new Exception\InvalidArgumentException( 'Cannot set session name after a session has already started'

Environment & details:

GET Data empty

POST Data empty

Files empty

Key	Value
language	"it"
VUFIND_SESSION	"f2a51e71be9cb383bb75146d5aeeef66"
ui	"standard"

Session

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1790948308.6232 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "f2a51e71be9cb383bb75146d5aeeef66" ]`]
SessionState	Laminas\Stdlib\ArrayObject {#938}
FlashMessenger	Laminas\Stdlib\ArrayObject {#1433}
SessionHelper	Laminas\Stdlib\ArrayObject {#1759}

Server/Request Data

Key	Value
REDIRECT_VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
REDIRECT_HTTPS	"on"
REDIRECT_SSL_TLS_SNI	"info.umar.mx"
REDIRECT_STATUS	"200"
VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
HTTPS	"on"
SSL_TLS_SNI	"info.umar.mx"
HTTP_ACCEPT	"/"
HTTP_USER_AGENT	"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)"
HTTP_COOKIE	"language=it; VUFIND_SESSION=f2a51e71be9cb383bb75146d5aeeef66; ui=standard"
HTTP_ACCEPT_ENCODING	"gzip, br, zstd, deflate"
HTTP_HOST	"info.umar.mx"
PATH	"/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/snap/bin"
SERVER_SIGNATURE	"<address>Apache/2.4.66 (Ubuntu) Server at info.umar.mx Port 443</address>\n"
SERVER_SOFTWARE	"Apache/2.4.66 (Ubuntu)"
SERVER_NAME	"info.umar.mx"
SERVER_ADDR	"200.23.222.19"
SERVER_PORT	"443"
REMOTE_ADDR	"216.73.217.142"
DOCUMENT_ROOT	"/usr/local/vufind/public"
REQUEST_SCHEME	"https"
CONTEXT_PREFIX	""
CONTEXT_DOCUMENT_ROOT	"/usr/local/vufind/public"
SERVER_ADMIN	"admin@localhost"
SCRIPT_FILENAME	"/usr/local/vufind/public/index.php"
REMOTE_PORT	"17938"
REDIRECT_URL	""" /Record/\n arxiv_https___arxiv_org_abs_2510_01931/Similar """
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	""
REQUEST_URI	"/Record/%0Aarxiv_https___arxiv_org_abs_2510_01931/Similar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1790948308.6079
REQUEST_TIME	1790948308

Environment Variables empty

Registered Handlers

0. Whoops\Handler\PrettyPageHandler