Abstract The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that NMC disconnects given terminals, SFVS intersects all cycles containing set. We design meta-algorithm allows to solve in time $$2^{O(rw^3)}\cdot n^{4}$$ <mml:m...

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

Graph-based methods have become well-established tools for image segmentation. Viewing the image as a weighted graph, these methods seek to extract a graph cut that best matches the image content. Many of these methods are interactive, in that they allow a human operator to guide the segmentation process by specifying a set of hard constraints that the cut must satisfy. Typically, these constra...

The support of a set A is the crisp subset of A with nonzero membership grades. Similarly, the core of a set A is the crisp subset of A with membership grade equal to one. So, supp(A) = {x|μA(x) > 0} and core(A) = {x|μA(x) = 1}. (1.1.4) The α-cut Aα of a set A is the crisp subset of A with membership grades of at least α. So, Aα = α-cut(A) = {x|μA(x) ≥ α}. (1.1.5) Note that core(A) = 1-cut(A). ...

In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm...

The simple max-cut problem is as follows: given a graph, find a partition of its vertex set into two disjoint sets, such that the number of edges having one endpoint in each set is as large as possible. A split graph is a graph whose vertex set admits a partition into a stable set and a clique. The simple max-cut decision problem is known to be NP-complete for split graphs. An indifference grap...

We investigate various notions of sobriety for topological spaces that are equivalent in ZF set theory with the Axiom of Choice but may differ in the absence of choice principles. The Ultrafilter Principle UP (alias Prime Ideal Theorem) suffices for the desired conclusions. We derive from UP three topological postulates and prove their equivalence in ZF without choice: the Well-Filtration Princ...