Sciweavers

1736 search results - page 279 / 348
» On antimagic directed graphs
Sort
View
IPCO
2004
114views Optimization» more  IPCO 2004»
15 years 1 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
IJCAI
2001
15 years 1 months ago
A Perspective on Knowledge Compilation
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
Adnan Darwiche, Pierre Marquis
MCU
2004
129views Hardware» more  MCU 2004»
15 years 1 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Florin Manea, Carlos Martín-Vide, Victor Mi...
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 1 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
FLAIRS
2000
15 years 1 months ago
Independence Semantics for BKBs
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
Solomon Eyal Shimony, Eugene Santos Jr., Tzachi Ro...